zbMATH — the first resource for mathematics

MINTO, a Mixed INTeger Optimizer. (English) Zbl 0806.90095
Summary: MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations. It also provides automatic constraint classification, preprocessing, primal heuristics and constraint generation. Moreover, the user can enrich the basic algorithm by providing a variety of specialized application routines that can customize MINTO to achieve maximum efficiency for a problem class.

90C11 Mixed integer programming
PDF BibTeX Cite
Full Text: DOI
[1] CPLEX Optimization, Inc., Using the CPLEX^{TM} linear optimizer, (1990)
[2] IBM Corporation, Optimization subroutine library, guide and reference, (1990)
[3] Nemhauser, G.L.; Wolsey, L.A., Integer programming and combinatorial optimization, (1988), Wiley Chichester · Zbl 0469.90052
[4] Nemhauser, G.L.; Savelsbergh, M.W.P.; Sigismondi, G.S., Constraint classification for mixed integer programming formulations, COAL bulletin, 20, 8-12, (1992)
[5] Savelsbergh, M.W.P.; Nemhauser, G.L., Functional description of MINTO, a mixed integer optimizer, () · Zbl 0768.90040
[6] Savelsbergh, M.W.P., Preprocessing and probing for mixed integer programming problems, ORSA J. computing, (1994), to appear · Zbl 0814.90093
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.