Branch Cut and Price Software
This page contains pointers to noncommercial
software for solving mixed-integer linear programs. Here is a (somewhat
outdated)
paper reviewing a number of these codes.
- SYMPHONY MILP Solver Framework
- Generic MILP Solver
- Generic Bicriteria MILP Solver
- Traveling Salesman Solver
- Vehicle Routing Solver
- Set Partitioning Solver
- Mixed Postman Solver
- Matching Solver
- Capacitated Network Routing Problem
- Multi-Criteria Knapsack Problem
-
ABACUS
-
COIN/BCP
-
bonsaiG
-
COIN/CBC
-
GLPK
-
lp_solve
-
MINTO
-
CONCORDE Traveling Salesman Problem Solver
Other Software
-
FlopC++ Modeling Language (works with SYMPHONY)
-
ZIMPL Modeling Language
Download SYMPHONY
This page maintained by Ted Ralphs (ted@branchandcut.org)
Last updated Decmber 24, 2004