Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study

References

• Achterberg T. Conflict analysis. (2006) Presentation, SCIP Workshop at ZIBOctober 10–11(Konrad-Zuse-Zentrum fur Informationstechnik Berlin, Berlin) . http://scip.zib.de/download/slides/SCIP-conflictAnalysis.pptGoogle Scholar
• Achterberg T., Berthold T. Improving the feasibility pump. (2005) . ZIB-Report 05-42, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin-Dahlem, GermanyGoogle Scholar
• Achterberg T., Koch T., Martin A. MIPLIB 2003. Oper. Res. Lett. (2006a) 34:1–12Crossref, Google Scholar
• Achterberg T., Koch T., Martin A. Mixed Integer Problem Library (MIPLIB) 2003. (2006b) . http://miplib.zib.de/Google Scholar
• Applegate D., Bixby E., Chvatal V., Cook W. Finding cuts in the TSP. (1995) . Technical Report 95-05, DIMACS, Rutgers University, Piscataway, NJGoogle Scholar
• Ashford R. Mixed integer programming: A historical perspective with Xpress-MP. Ann. Oper. Res. (2007) 149:5–17Crossref, Google Scholar
• Atamturk A., Nemhauser G. L., Savelsbergh M. W. P. Conflict graphs in integer programming. (1998) . Technical Report LEC 98-03, Georgia Institute of Technology, AtlantaGoogle Scholar
• Balas E., Perregaard M. Lift-and-project for mixed 0-1 programming: Recent progress. Discrete Appl. Math. (2002) 123:129–154Crossref, Google Scholar
• Balas E., Saxena A. Optimizing over the split closure. (2005) . Research Report MSRR-674, Tepper School of Business, Carnegie Mellon University, PittsburghGoogle Scholar
• Balas E., Saxena A. Optimizing over the split closure. Math. Programming Ser. A (2008) 113:219–240Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming (1993) 58:295–324Crossref, Google Scholar
• Brearley A. L., Mitra G., Williams H. P. Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Programming (1975) 8(1):54–83Crossref, Google Scholar
• Cordier C., Marchand H., Laundy R., Wolsey L. bc-opt: A branch-and-cut code for mixed integer programs. Math. Programming (1999) 86:335–354Crossref, Google Scholar
• Cornuéjols G. Valid inequalities for mixed integer linear programs. Math. Programming (2007) 112:3–44Crossref, Google Scholar
• Crowder H., Johnson E. L., Padberg M. W. Solving large-scale zero-one linear programming problems. Oper. Res. (1983) 31:803–834Link, Google Scholar
• Dash OptimizationXpress-MP Optimizer Reference Manual (2005) (Dash Optimization Ltd., Nothants, UK) Google Scholar
• Dash Optimization Explore Xpress-MP. (2008) . http://www.fairisaac.com/xpressmpGoogle Scholar
• Ferris M. GAMS, Condor and the grid: Solving hard optimization problems in parallel. (2006) PresentationSeptember 22(Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA) Google Scholar
• Fischetti M., Lodi A. Local branching. Math. Programming Ser. B (2003) 98:23–47Crossref, Google Scholar
• Gomory R. E. An algorithm for the mixed integer problem. (1960) . Technical Report RM-2597, RAND Corporation, Santa Monica, CAGoogle Scholar
• Guéret C., Prins C., Sevaux M.Applications of Optimization with Xpress-MP (2002) (Dash Optimization Ltd., Nothants, UK) . [Translated by Susanne Heipcke.]Google Scholar
• Hansen P., Mladenović N., Uroević D. Variable neighborhood search and local branching. Comput. Oper. Res. (2006) 33:3034–3045Crossref, Google Scholar
• Hoffman K. L., Padberg M. Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. (1991) 3:121–134Link, Google Scholar
• Kroon L. Personal communication. (2002) Google Scholar
• Laundy R., Ciriani T., Gliozzi S., Johnson E., Tadei R. Implementation of parallel branch-and-bound algorithms in Xpress-MP. Operational Research in Industry (1999) (Palgrave Macmillan, Basingstoke, Hampshire, UK) 25–41Crossref, Google Scholar
• Luzzi I. Exact and heuristic methods for nesting problems. (2002) . Ph.D. thesis, University of Padova, Padova, ItalyGoogle Scholar
• Padberg M. W., Van Roy T. J., Wolsey L. A. Valid inequalities for fixed charge problems. Oper. Res. (1985) 33:842–861Link, Google Scholar
• Perregaard M. A practical implementation of lift-and-project cuts: A computational exploration of lift-and-project cuts with Xpress-MP. (2003) Presentation, 18th International Symposium on Mathematical Programming (ISMP 2003)August 18–22Copenhagen(Mathematical Programming Society, Phildelphia) . http://www.dashoptimization.com/home/downloads/pdf/ismp2003_MP.pdfGoogle Scholar
• Savelsbergh M. W. P. Preprocessing and probing for mixed integer programming problems. ORSA J. Comput. (1994) 6:445–454Link, Google Scholar
• van Hoesel S., Goessens J. W., Kroon L. A branch-and-cut approach to line planning problems. (2001) . Working paper, Erasmus University Rotterdam, Rotterdam, The NetherlandsGoogle Scholar
• Van Roy T. J., Wolsey L. A. Solving mixed integer programming problems using automatic reformulation. Oper. Res. (1987) 35:45–57Link, Google Scholar
• Van Vyve M., Pochet Y. A general heuristic for production planning problems. (2001) . CORE Discussion Paper 56, Center for Operations Research and Econometrics, Université catholique de Louvain, Louvain-la-Neuve, BelgiumGoogle Scholar
• Vazacopoulos A. State-of-the-art optimimation using Xpress-MP 2006A. (2006a) Preconference workshop presentation, INFORMS Practice MeetingApril 30Miami(INFORMS, Hanover, MD) . http://www.dashoptimization.com/home/downloads/pdf/Informs_Practice_2006_workshop.pdfGoogle Scholar
• Vazacopoulos A., Laundy R., Tavares G. State-of-the-optimization using Xpress-MP v2006. (2006b) Presentation, INFORMS Annual MeetingNovember 6Pittsburgh(INFORMS, Hanover, MD) . http://miplib.zip.de/paper/vazacopoulos2006.pdfGoogle Scholar
• Wolsey L.Integer Programming (1998) (John Wiley & Sons, New York) Google Scholar