Active-constraint variable ordering for faster feasibility of mixed integer linear programs

Mathematical Programming

Volumn 110, Issue 3, 2007, Pages 445-474

  Patel, Jagat ^a   Chinneck, John W ^b  

^a NORTEL NETWORKS   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING;

ACTIVE CONSTRAINTS; BRANCHING VARIABLE; CANDIDATE VARIABLES;

CONSTRAINT THEORY;

EID: 34249850752     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0009-0     Document Type: Article

References (33)

1. Balas, E., Martin, C.: Pivot and Complement - a Heuristic for 0-1 Programming. Manage. Sci. 26, 224-234 (1980)
2. Balas, E., Martin, C.: Pivot and Shift - a Heuristic for Mixed Integer Programming. GSIA, Carnegie Mellon University (1986)
3. Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: a New Heuristic for Pure 0-1 Programs. Oper. Res. 49, 207-225 (2001)
4. Balas, E., Schmieta, S., Wallace, C.: Pivot and Shift - a Mixed Integer Programming Heuristic. Discrete Optim. 1, 3-12 (2004)
5. Beale, E.M.L.: Mathematical Programming in Practice. Pitmans, London (1968)
6. Beale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Proceedings of the fifth international conference on operational research, pp. 447-454. Tavistock publication, London (1970)
7. Benichou, M., Gauthier, J.M., Girodet, P., Hentges, G., Ribiere, G., Vincent, O.: Experiments in mixed-integer linear programming. Math. Prog. 1, 76-94 (1971)
8. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12-15 (1998)
9. Dakin, R.J.: A tree search algorithm for mixed integer programming problems. Comput. J. 8, 250-255 (1965)
10. Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Prog. Ser. A102, 71-90 (2005)
11. Dolan, E.D., Moreé J.: Benchmarking optimization software with performance profiles. Math. Prog. Ser. A 91, 201-213 (2002)
12. Eckstein, J.: Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM J. Optim. 4, 794-814 (1994)
13. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Prog. Ser. A 104, 91-104 (2005)
14. Forest, J.J.H., Hirst, J.P.H., Tomlin, J.A.: Practical solution of large scale mixed integer programming problems with UMPIRE. Manage. Sci. 20, 736-773 (1974)
15. Gauthier, J.M., Ribiere, G.: Experiments in mixed-integer linear programming. Math. Prog. 12, 26-47 (1977)
16. Glover, F.: Surrogate constraints. Oper. Res. 16, 741-749 (1968)
17. Glover, F.: Tutorial on surrogate constraint approaches for optimization in graphs. J. Heuristics 9, 175-227 (2003)
18. Greenberg, H.J.: Mathematical programming glossary. Online: http://glossary.computing.society.informs.org (2005)
19. Guieu, O., Chinneck, J.W.: Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11, 63-77 (1999)
20. Hirst, J.P.H.: Features required in Branch-and-Bound Algorithms for (0-1) mixed integer linear programming, unpublished manuscript (1969)
21. ILOG Corporation.: Cplex 9.0 Callable Library Reference Manual (2003)
22. ILOG Corporation.: Cplex 9.0 C++ API Reference Manual (2003)
23. ILOG Corporation.: Cplex 9.0 User's Manual (2003)
24. Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P.: Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12, 2-23 (2000)
25. Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. Econometrica 28, 497-520 (1960)
26. Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11, 173-187 (1999)
27. Lokketangen, A., Glover, F.: Surrogate constraint analysis - new heuristics and learning schemes for satisfiability problems. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 35, 537-572 (1997)
28. Mitra, G.: Investigation of some branch-and-bound strategies for the solution of mixed integer linear programs. Math. Progr. 5, 155-170 (1973)
29. MIPLIB2003.: Library of mixed-integer linear programming test models at http://miplib.zib.de/miplib2003.php (2005)
30. Mittelman, H.: Benchmark for Optimization Software web-site at http://plato.la.asu.edu/bench.html (2001)
31. Padberg, M.W, Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60-100 (1991)
32. Small, R.E.: Mixed integer programming by a branch and bound technique. Proc. the 3rd IFIP Congress 2, 450-451 (1965)
33. Tomlin. J.A.: An improved branch-and-bound method for integer programming. Oper. Res. 19, 1070-1075 (1969)