Abstract
This paper describes a heuristic for 0-1 mixed-integer linear programming problems, focusing on “stand-alone” implementation. Our approach is built around concave “merit functions” measuring solution integrality, and consists of four layers: gradient-based pivoting, probing pivoting, convexity/intersection cutting, and diving on blocks of variables. The concavity of the merit function plays an important role in the first and third layers, as well as in connecting the four layers. We present both the mathematical and software details of a test implementation, along with computational results for several variants.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anbil, R., Barahona, F., Rushmeier, R., Snowdon, J.: IBM makes advances in airline optimization. Research Report RC21465(96887), IBM T.J. Watson Research Center, Yorktown Heights, NY (1999)
Balas, E.: Intersection cuts—a new type of cutting planes for integer programming. Oper. Res. 19, 19–39 (1971)
Balas, E.: Integer programming and convex analysis: intersection cuts from outer polars. Math. Program. 2, 330–382 (1972)
Balas, E., Martin, C.H.: Pivot-and-complement—a heuristic for 0-1 programming. Manag. Sci. 26(1), 86–96 (1980)
Balas, E., Bowman, V.J., Glover, F., Sommer, D.: An intersection cut from the dual of the unit hypercube. Oper. Res. 19, 40–44 (1971)
Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: a new heuristic for pure 0-1 programs. Oper. Res. 49(2), 207–225 (2001)
Bali, S., Jacobsen, S.E.: On the convergence of the modified Tui algorithm for minimizing a concave function on a bounded convex polyhedron. In: Optimization Techniques. Proc. 8th IFIP Conf., Würzburg, 1977, Part 2. Lecture Notes in Control and Information Science, vol. 7, pp. 59–66. Springer, Berlin (1978)
Beale, E.M.L.: Branch and bound methods for mathematical programming systems. Ann. Discret. Math. 5, 201–219 (1979). Discrete optimization (Proc. Adv. Res. Inst. Discrete Optimization and Systems Appl., Banff, Alta., 1977), II
Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Boston (1999)
Bixby, R.E., Ceria, S., McZeal, C.M., Savelsberg, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Technical Report 98-3, Department of Computational and Applied Mathematics, Rice University (1998)
Burdet, C.-A.: Enumerative inequalities in integer programming. Math. Program. 20(1), 32–64 (1972)
Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71–90 (2005)
Eckstein, J.: Parallel branch-and-bound methods for mixed-integer programming on the CM-5. SIAM J. Optim. 4(4), 794–814 (1994)
Eckstein, J., Nediak, M.: Depth-optimized convexity cuts. Ann. Oper. Res. 139, 95–129 (2005)
Eckstein, J., Phillips, C.A., Hart, W.E.: PICO: an object-oriented framework for parallel branch and bound. In: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, Haifa, 2000, pp. 219–265. North-Holland, Amsterdam (2001)
Faaland, B.H., Hillier, F.S.: Interior path methods for heuristic integer programming procedures. Oper. Res. 27(6), 1069–1087 (1979)
Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91–104 (2005)
Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1–3), 23–47 (2003)
Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: A practical anti-cycling procedure for linearly constrained optimization. Math. Program. 45(3), 437–474 (1989)
Glover, F.: Cut search methods in integer programming. Math. Program. 3, 86–100 (1972)
Glover, F.: Convexity cuts and cut search. Oper. Res. 21, 123–134 (1973)
Glover, F., Laguna, M.: General purpose heuristics for integer programming—part I. J. Heuristics 2, 343–358 (1997a)
Glover, F., Laguna, M.: General purpose heuristics for integer programming—part II. J. Heuristics 3, 161–179 (1997b)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997c)
Hillier, F.S.: Efficient heuristic procedures for integer linear programming with an interior. Oper. Res. 17(4), 600–637 (1969)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic, Dordrecht (1995)
Ibaraki, T., Ohashi, T., Mine, H.: A heuristic algorithm for mixed-integer programming problems. Math. Program. Study 2, 115–136 (1974)
Linderoth, J.T.: Topics in parallel integer optimization. Ph.D. thesis, Department of Industrial and Systems Engineering, Georgia Institute of Technology (1998)
Løkketangen, A., Glover, F.: Solving zero/one mixed integer programming problems using tabu search. Eur. J. Oper. Res. 106, 624–658 (1998)
Raghavachari, M.: On connections between zero-one integer programming and concave programming under linear constraints. Oper. Res. 17, 680–684 (1969)
Ralphs, T.K., Ladányi, L.: SYMPHONY User’s Manual: preliminary draft. http://branchandcut.org/SYMPHONY/man/man.html (2000)
Tuy, H.: Concave programming under linear constraints. Sov. Math. 5(6), 1437–1440 (1964)
Tuy, H.: Normal conical algorithm for concave minimization over polytopes. Math. Program. 51(2), 229–245 (1991)
Vanderbei, R.J.: Linear Programming: Foundations and Extensions, 2nd edn. Kluwer Academic, Boston (2001)
Zwart, P.B.: Nonlinear programming: counterexamples to two global optimization algorithms. Oper. Res. 21(6), 1260–1266 (1973)
Zwart, P.B.: Global maximization of a convex function with linear inequality constraints. Oper. Res. 22(3), 602–609 (1974)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Eckstein, J., Nediak, M. Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming. J Heuristics 13, 471–503 (2007). https://doi.org/10.1007/s10732-007-9021-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-007-9021-7