CINXE.COM

CORAL at Lehigh University

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML> <HEAD> <TITLE>CORAL at Lehigh University</TITLE> <!-- <link href="/style/style.css" rel="stylesheet" type=text/css> --> <link href="/images/title_logo.png" rel="icon" type="image/x-icon"> </head> <BODY> <!-- <script language="javascript" src="/menu2.js"></script> --> <div id="content_box"> <!-- anything over this remains the same --> <h1>MINTO - Mixed INTeger Optimizer</h1> <h3>Introduction</h3> <p> 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. </p> <p> To be as effective and efficient as possible when used as a general purpose mixed-integer optimizer, MINTO attempts to: <ul> <li> improve the formulation by preprocessing and probing; <li> construct feasible solutions <li> generate strong valid inequalities <li> perform variable fixing based on reduced prices <li> control the size of the linear programs by managing active constraints. </ul> To be as flexible and powerful as possible when used to build a special purpose mixed-integer optimizer, MINTO provides various mechanisms for incorporating problem specific knowledge. </p> <hr> <h3> Using MINTO with AMPL </h3> <p> MINTO has also recently been equipped with the ability to act as a solver directly through the <a href="http://www.ampl.com">AMPL</a> modeling language. Here is a <a href="minto-ampl-options.html">table</a> of minto options that can be set through AMPL. This solver is provided as a public service through <a href="http://www-neos.mcs.anl.gov/neos/solvers/MILP:MINTO-AMPL/">NEOS</a>. </p> <hr> <h3> MINTO Availability </h3> <p> <strong>MINTO is available from this website (<a href="http://coral.ie.lehigh.edu">CORAL)</a>. By downloading software from this site, you agree to the terms of the license agreement, created by the Georgia Tech Research Institute. Please read it before downloading the software.</strong> </p> <p><strong><a href="http://coral.ie.lehigh.edu/~minto/download.html">View the License Agreement and Download the Software</a></strong></p> <hr> <h3> MINTO in Coral </h3> <p> In <a href="http://coral.ie.lehigh.edu">CORAL</a>, Minto is installed in <tt>/usr/local</tt>. How to use and build MINTO is described in <a href="http://coral.ie.lehigh.edu/cgi-bin/wiki.pl?MintoInformation">Coral-Wiki here.</a> </p> <hr> <h3> Relevant publications </h3> <p> A. Atamturk, G.L. Nemhauser, M.W.P. Savelsbergh (2000). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/ejor121.pdf"> Conflict Graphs in Integer Programming</a>. European Journal of Operations Research 121, 40-55. <br> <br> Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh (1999). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/ijoc11a.pdf">Cover Inequalities for 0-1 Linear Programs: Complexity</a>. INFORMS J. on Computing 11, 117-123. <br> <br> J. Linderoth, M.W.P. Savelsbergh (1999). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/ijoc11b.pdf"> A Computational Study of Search Strategies for Mixed Integer Programming</a>. INFORMS J. on Computing 11, 173-187. <br> <br> Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh (1999). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/mathprog85a.pdf">Lifted Flow Covers for Mixed 0-1 Integer Programs</a>. Mathematical Programming 85, 439-468. <br> <br> Gu, G.L., Nemhauser, and M.W.P. Savelsbergh (1998). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/ijoc10.pdf">Cover Inequalities for 0-1 Linear Programs: Computation</a>. INFORMS Journal on Computing 10, 427-437. <br> <br> G.L. Nemhauser, M.W.P. Savelsbergh, G.S. Sigismondi (1994). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/orl15.pdf"> MINTO, a Mixed INTeger Optimizer</a>. Oper. Res. Letters 15, 47-58. <br> <br> M.W.P. Savelsbergh (1994). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/ojoc6.pdf">Preprocessing and Probing for Mixed Integer Programming Problems</a>. ORSA J. on Computing 6, 445-454. <br> <br> M.W.P. Savelsbergh, G.L. Nemhauser (1998). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/doc30.pdf"> Functional description of MINTO, a Mixed INTeger Optimizer (Version 3.0)</a>. Report COC-91-03D, Georgia Institute of Technology. <br> <br> M.W.P. Savelsbergh, G.L. Nemhauser (1995). <a href="http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/shortcrs.pdf"> A MINTO short course</a>. Report COC-95-xx, Georgia Institute of Technology. </p> </body></html>

Pages: 1 2 3 4 5 6 7 8 9 10