Faster integer-feasibility in mixed-integer linear programs by branching to force change

Computers and Operations Research

Volumn 38, Issue 8, 2011, Pages 1143-1152

  Pryor, Jennifer ^a   Chinneck, John W ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Branching; Integer feasibility; Mixed integer programming

Indexed keywords

BRANCHING; CHILD NODE; EMPIRICAL RESULTS; FEASIBLE SOLUTION; INTEGER FEASIBILITY; MIXED INTEGER LINEAR PROGRAM; MIXED-INTEGER; MIXED-INTEGER PROGRAMMING;

LINEAR PROGRAMMING;

INTEGER PROGRAMMING;

EID: 78650511452     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.10.025     Document Type: Article

References (21)

1. E.L. Johnson, G.L. Nemhauser, and M.W.P. Savelsbergh Progress in linear-programming-based algorithms for integer programming: an exposition INFORMS Journal on Computing 12 2000 2 23
2. T. Achterberg, T. Koch, and A. Martin Branching rules revisited Operations Research Letters 33 2005 42 54
3. R.R. Meyer, W.D. D'Souza, M.C. Ferris, and B.R. Thomadsen MIP models and BB strategies in brachytherapy treatment optimization Journal of Global Optimization 25 2003 23 42
4. Jariwala A. Efficient branch and bound algorithm for the dynamic layout problem. Master's thesis, College of Engineering and Technology, Ohio University, 1995.
5. K.P. Bernatzki, M.R. Bussieck, T. Lindner, and M.E. Lübbecke Optimal scrap combination for steel production OR Spektrum 20 1998 251 258
6. N.J. Driebeek An algorithm for the solution of mixed integer programming problems Management Science 12 1966 576 587
7. J.A. Tomlin An improved branch-and-bound method for integer programming Operations Research 19 1971 1070 1075
8. Linderoth J, Ralphs T. Noncommercial software for mixed-integer linear programming. Technical Report 04T-023, Department of Industrial and Systems Engineering, Lehigh University. Online: 〈 www.lehigh.edu/jtl3/teaching/ ie418/papers/MILP04.pdf 〉, 2004.
9. Makhorin A. GNU linear programming kit reference manual version 4.28. 〈 http://www.gnu.org/software/glpk/ 〉, [accessed May 2008], 2008.
10. Balas E, Martin C. Pivot and shift - a heuristic for mixed integer programming. GSIA Technical Report, Carnegie Mellon University, 1986.
11. E. Balas, S. Ceria, M. Dawande, F. Margot, and G. Pataki OCTANE: a new heuristic for pure 0-1 programs Operations Research 49 2001 207 225
12. M. Fischetti, F. Glover, and A. Lodi The feasibility pump Mathematical Programming A 104 2005 91 104
13. J. Patel, and J.W. Chinneck Active-constraint variable ordering for faster feasibility of mixed integer linear programs Mathematical Programming, Series A 110 2007 445 474
14. E.D. Dolan, and J. Moré Benchmarking optimization software with performance profiles Mathematical Programming, Series A 91 2002 201 213
15. T. Achterberg, T. Koch, and A. Martin MIPLIB 2003 Operations Research Letters 34 2006 1 12
16. R.E. Bixby, S. Ceria, C.M. McZeal, and M.W.P. Savelsbergh An updated mixed integer programming library, MIPLIB 3.0 Optima 58 1998 12 15
17. R.E. Bixby, E.A. Boyd, and R.R. Indovina MIPLIB: a test set of mixed integer programming problems SIAM News 25 2 1992
18. Linderoth J. Coral: mixed integer programming instances. 〈 http://coral.ie.lehigh.edu/mip-instances/ 〉, accessed May 2009.
19. Pesant G, Quimper CG. Counting solutions of knapsack constraints. In: Proceedings of the CPAIOR 2008, Lecture Notes in Computer Science, vol. 5015, 2008. p. 203-17
20. Abramowitz M, Stegun IA, editors. Handbook of mathematical functions. National Bureau of Standards, Applied Mathematics Series, 1965. p. 932.
21. Pryor J. Branching variable direction selection in mixed integer programming. Master's thesis, Systems and Computer Engineering, Carleton University, 2009.