Practical Guidelines for Solving Difficult Mixed Integer Linear
暂无分享,去创建一个
[1] Robert E. Bixby,et al. Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..
[2] Dimitris Bertsimas,et al. The Air Traffic Flow Management Problem with Enroute Capacities , 1998, Oper. Res..
[3] Laurence A. Wolsey,et al. Decomposition of Integer Programs and of Generating Sets , 1997, ESA.
[4] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[5] Jeffrey D. Camm,et al. Cutting Big M Down to Size , 1990 .
[6] Tobias Achterberg,et al. Constraint integer programming , 2007 .
[7] Andrea Lodi,et al. MIPLIB 2010 , 2011, Math. Program. Comput..
[8] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[9] Manfred W. Padberg,et al. The Sharpest Cut (MPS-Siam Series on Optimization) , 2004 .
[10] Alexandra M. Newman,et al. Practical guidelines for solving difficult linear programs , 2013 .
[11] Arjen K. Lenstra,et al. Hard Equality Constrained Integer Knapsacks , 2002, Math. Oper. Res..
[12] Andrea Lodi,et al. Performance Variability in Mixed-Integer Programming , 2013 .
[13] Martin W. P. Savelsbergh,et al. Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..
[14] Lawrence J. Watters. Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..
[15] G. Nemhauser,et al. Integer Programming , 2020 .
[16] Alexandra M. Newman,et al. Open-Pit Block-Sequencing Formulations: A Tutorial , 2014, Interfaces.
[17] Gerhard Reinelt,et al. A tutorial on branch and cut algorithms for the maximum stable set problem , 2012, Int. Trans. Oper. Res..
[18] Eric R. Zieyel. Operations research : applications and algorithms , 1988 .