MINTO

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 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.

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)

External links

MINTO Homepage

Mathematical optimization software

Data formats	LP MPS nl OptML OSiL sol xMPS

Modeling tools	AIMMS AMPL APMonitor CMPL CVX CVXOPT CVXPY ECLiPSe-CLP GAMS GNU MathProg JuMP LINDO OPL MPL OptimJ PICOS PuLP Pyomo ROML TOMLAB Xpress-Mosel YALMIP ZIMPL

LP, MILP^∗ solvers	ABACUS^∗ APOPT^∗ Artelys Knitro^∗ BCP^∗ BDMLP BPMPD BPOPT CLP CBC^∗ CPLEX^∗ CSDP DSDP FortMP^∗ GCG^∗ GIPALS32 GLPK/GLPSOL^∗ Gurobi^∗ HOPDM LINDO^∗ lp_solve^∗ LOQO MINOS MINTO^∗ MOSEK^∗ OOPS OOQP PCx QSopt SAS/OR^∗ SCIP^∗ SoPlex SOPT-IP^∗ Sulum Optimization Tools^∗ SYMPHONY^∗ XA^∗ Xpress-Optimizer^∗

QP, MIQP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT BQPD CBC^∗ CLP CPLEX^∗ FortMP^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LSSOL LOQO MINOS MOSEK^∗ OOPS OOQP QPOPT QPSOL SCIP^∗ XA Quadratic Solver Xpress-Optimizer^∗

QCP, MIQCP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT CPLEX^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LOQO MINOS MOSEK^∗ SCIP^∗ Xpress-Optimizer^∗ Xpress-SLP^∗

SOCP, MISOCP^∗ solvers	CPLEX^∗ DSDP Gurobi^∗ LINDO^∗ LOQO MOSEK^∗ SCIP^∗ SDPT3 SeDuMi Xpress-Optimizer^∗

SDP, MISDP^∗ solvers	CSDP DSDP MOSEK PENBMI PENSDP SCIP-SDP^∗ SDPA SDPT3 SeDuMi

NLP, MINLP^∗ solvers	ALGENCAN AlphaECP^∗ ANTIGONE^∗ AOA^∗ APOPT^∗ Artelys Knitro^∗ BARON^∗ Bonmin^∗ BPOPT CONOPT Couenne^∗ DICOPT^∗ FilMINT^∗ FilterSQP Galahad library ipfilter IPOPT LANCELOT LINDO^∗ LOQO LRAMBO MIDACO^∗ MILANO^∗ MINLP BB^∗ MINOS Minotaur^∗ MISQP^∗ NLPQLP NPSOL OQNLP^∗ PATHNLP PENNON SBB^∗ SCIP^∗ SNOPT^∗ SQPlab WORHP Xpress-SLP^∗

GO solvers	BARON Couenne^∗ LINDO SCIP

CP solvers	Artelys Kalis Choco Comet CPLEX CP Optimizer Gecode Google CP Solver JaCoP OscaR

Metaheuristic solvers	OptaPlanner LocalSolver

List of optimization software Comparison of optimization software

This article is issued from Wikipedia - version of the 11/20/2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.

MINTO

References

See also

External links