Heuristics for convex mixed integer nonlinear programs

Computational Optimization and Applications

Volumn 51, Issue 2, 2012, Pages 729-747

  Bonami, Pierre ^a   Gonçalves, João P M ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Heuristics; Mixed integer nonlinear programming

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL EXPERIMENT; FEASIBLE SOLUTION; HEURISTICS; MIXED INTEGER LINEAR PROGRAM; MIXED INTEGER NONLINEAR PROGRAM; MIXED-INTEGER NONLINEAR PROGRAMMING; NEIGHBORHOOD SEARCH; SOLUTION TIME;

ALGORITHMS; BRANCH AND BOUND METHOD;

INTEGER PROGRAMMING;

EID: 84862002951     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-010-9350-6     Document Type: Article

References (15)

1. Abhishek, K., Leyffer, S., Linderoth, J.T.: Feasibility pump heuristics for mixed integer nonlinear programs. Unpublished Working Paper (2008)
2. Abhishek, K., Leyffer, S., Linderoth, J.T.: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS J. Comput. doi:10.1287/ijoc.1090.0373 (2010)
3. Berthold, T.: Primal heuristics for mixed integer programs. Master's thesis, Technical University of Berlin (2006)
4. Berthold, T., Gleixner, A.M.: Undercover - a primal heuristic for MINLP based on sub-MIPs generated by set covering. ZIB-Report 09-04, Konrad-Zuse-Zentrum für Informationstechnik Berlin (2009)
5. Bonami, P., Biegler, L.T., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5, 186-204 (2008) (Pubitemid 351443148)
6. Bonami, P., Cornuéjols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119, 331-352 (2009)
7. Bonami, P., Lee, J.: Bonmin User's Manual (2007). www.coin-or.org
8. Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102, 71-90 (2005) (Pubitemid 40134692)
9. Duran, M., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307-339 (1986) (Pubitemid 17510523)
10. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104, 91-104 (2005) (Pubitemid 41218556)
11. Fischetti, M., Lodi, A.: Local branching. Math. Program. 104, 23-47 (2003)
12. Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Math. Program. Comput. 1, 201-222 (2009)
13. Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66, 327-349 (1994)
14. Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295-309 (2001) (Pubitemid 32457216)
15. Quesada, I., Grossmann, I.: An LP/NLP based branched and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16, 937-947 (1992) (Pubitemid 23602202)