sdiehl-universal-solver
Integrates Z3, CVXPY, and Google OR-Tools to solve constraint satisfaction, convex optimization, and scheduling problems with support for solver chaining where results from one solver feed into another for complex multi-stage optimization workflows.
- Score
- 86.8082 signals
- Evidence
- 65 stars · 8 forks
- Last commit
- as last read from GitHub; most reads are from 2 Sep 2026 or later
- Listed
Install
No one-command install. Set it up from its source.
Alternatives · MCPs
- szeider-minizinc-solver181 stars · 23 forks93.481
- jacck-ortools21 stars · 9 forks79.313
- davidorex-project-handoffs7 stars · 4 forks63.439
What it is
MCP server Universal Solver (Z3, CVXPY, OR-Tools), catalogued on PulseMCP. Integrates Z3, CVXPY, and Google OR-Tools to solve constraint satisfaction, convex optimization, and scheduling problems with support for solver chaining where results from one solver feed into another for complex multi-stage optimization workflows.
When to use it
Integrates Z3, CVXPY, and Google OR-Tools to solve constraint satisfaction, convex optimization, and scheduling problems with support for solver chaining where results from one solver feed into another for complex multi-stage optimization workflows.
Notes
Listed from the PulseMCP registry. The registry does not state a license. Check it before production use.