The NEOS Server offers MINTO for the solution of mixed-integer linear
programs posed in AMPL
MINTO 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. This version of MINTO uses the LP solver
Clp, from the
Coin-OR project to solve the relaxations.
The original authors of MINTO are:
The current maintainer and developer of MINTO is
Using the NEOS Server for MINTO
The user must submit a model in
format to solve a mixed-integer linear program.
Examples of models in AMPL format can be found in the
The model is specified by a model file, and optionally,
a data file and a commands file.
If the command file is specified it must contain
the AMPL solve command.
The commands file can contain any AMPL command or set options for MINTO.
by modifying the variable 'mintoamp_options'. See the
options page to
get a listing of the various options.
A few more items of note specific to the MINTO-AMPL solver
Enter the location of the ampl model (local file)
- The maximum CPU time for a job has been set to four hours
- The test problems submit to NEOS can and will be harvested.
Problems deemed "interesting" are made available to the public (as MPS
files) at COR@L
- The Osi and Clp COIN components used in the code are compiled
from the COIN CVS tree on 8/3/05
Enter the location of the ampl data file (local file)
Enter the location of the ampl commands file (local file)
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5
Please do not click the 'Submit to NEOS' button more than once.