Software section: MINTO, a mixed INTeger optimizer

Authors:
George L. Nemhauser;Martin W. P. Savelsbergh;Gabriele C. Sigismondi
Affiliations:
Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, GA 30332-0205, USA;Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, GA 30332-0205, USA;Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
1994

Citing 0
Cited 13

Disruption management in the airline industry-Concepts, models and methods

Computers and Operations Research
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities

Discrete Optimization
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement

Discrete Optimization
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints

Operations Research Letters
Cliques and clustering: A combinatorial approach

Operations Research Letters
Introduction to ABACUS - a branch-and-cut system11Partially supported by ESPRIT LTR Project no. 20244 - ALCOM-IT.

Operations Research Letters
A family of inequalities for the generalized assignment polytope

Operations Research Letters
A family of facets for the uncapacitated p-median polytope

Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope

Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope

Operations Research Letters
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

Operations Research Letters
Relax-and-fix decomposition technique for solving large scale grid-based location problems

Computers and Industrial Engineering
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.