neuromancer
Pytorch-based framework for solving parametric constrained optimization problems, physics-informed system identification, and parametric model predictive control.
- 1.4k
- Python
- 4 wk ago

Generic Constraint Development Environment
Repo Gecode/gecode, read from GitHub 1 d ago. Gecode has not joined Take My Repo.
Gecode/gecode is a public repo on GitHub by Gecode. Generic Constraint Development Environment. It declares no license on GitHub. Public does not mean open source: without a license, nobody is granted the right to reuse it. It is written mainly in C++, has 340 stars and last changed on 2026-11-19. Nobody has reviewed it on Take My Repo yet, which says nothing about its quality. Read from GitHub on 2026-11-20.
GitHub is limiting requests or did not answer. The facts on this page still come from the last successful read.
Open on GitHubGecode/gecode is a public repo on GitHub by Gecode. Generic Constraint Development Environment.
It declares no license on GitHub. Public does not mean open source: without a license, nobody is granted the right to reuse it.
Its maker has not tagged a system, so it is unknown here. Its README says what it needs.
Open "Take it" on its page: Take My Repo writes an install plan for your machine and hands it to your AI agent (Claude Code, Codex or Cursor), which asks you before each step. Take My Repo has not tested it on any machine.
Its last change on GitHub was on 2026-11-19. Take My Repo does not judge from that whether it is maintained.
Nobody has reviewed it on Take My Repo yet, which says nothing about its quality.
A hardware-agnostic SDK for optimization problems: define a problem once, then lower it to any quantum or classical solver
My public programs and models - mostly combinatorial problems and puzzles
Lightweight optimization with local, global, population-based and sequential techniques across mixed search spaces
The open source Solver AI for Java and Kotlin to optimize scheduling and routing. Solve the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.
A runnable reference implementation of multi-agent constraint propagation using Caura. 5 specialists share memory via MCP so decisions made upstream automatically govern downstream agents.