MINTO
From Wikipedia, the free encyclopedia
MINTO is an integer programming solver which uses branch and bound algorithm. It stands for Mixed Integer Optimizer.
MINTO is a software system that solves mixed integer programming problem by a branch and bound algorithm with linear programming relaxations. It also provides automatic constraint classification, preprocessing, primal heuristics and constraint generation. It also has inbuilt cut generation and can create knapsack cuts, GUB cuts, clique cuts, implication cuts, flow cuts, mixed integer rounding and Gomory cuts. Moreover, the user can enrich the basic algorithm by providing a variety of specialized application routines that can customize MINTO to achieve higher efficiency for a problem class.
MINTO does not have a linear programming (LP) solver of its own. It can use most of the LP solvers, like CLP, CPLEX, XPRESS through the OSI interface of COIN-OR. MINTO can read files in MPS (format) and can also be called as a solver from AMPL. It can run on both Linux and Windows operating system. MINTO is a non-commercial solver and the executables are available for free download from its home page at COR@L.
Contents |
[edit] See also
- MINTO Homepage
- COIN-OR, Computational Infrastructure for Operations Research
[edit] Other non-commercial solvers for MIPs
[edit] See also
[edit] References
- J.T. Linderoth and T.K. Ralphs, Noncommercial Software for Mixed-Integer Linear Programming, Integer Programming: Theory and Practice, John Karlof (ed.), CRC Press Operations Research Series, 2005, 253-303. (Working Paper Version PDF)
