Experiments with a feasibility pump approach for nonconvex MINLPs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6049 LNCS, Issue , 2010, Pages 350-360

  D'Ambrosio, Claudia ^a   Frangioni, Antonio ^b   Liberti, Leo ^c   Lodi, Andrea ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Experiments; Heuristic method; Mixed integer nonlinear programming; Nonconvex

Indexed keywords

EXPERIMENTS; GLOBAL OPTIMIZATION; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; PUMPS; TABU SEARCH;

COMPUTATIONAL RESULTS; FEASIBILITY PUMPS; GLOBAL OPTIMIZATION TECHNIQUES; METHODOLOGICAL INNOVATIONS; MIXED-INTEGER NONLINEAR PROGRAMMING; NONCONVEX; NONCONVEX MIXED-INTEGER NONLINEAR PROGRAMMING; NONLINEAR PROGRAMS;

HEURISTIC METHODS;

EID: 78149276660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_30     Document Type: Conference Paper

References (28)

1. Glover, F., Kochenberger, G. (eds.): Handbook of Metaheuristics. Kluwer Academic Publishers, Dordrecht (2003).
2. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Mathematical Programming 104, 91-104 (2004).
3. Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixedinteger problems. Discrete Optimization 4, 63-76 (2007).
4. Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optimization 4, 77-86 (2007).
5. Fischetti, M., Lodi, A.: Local branching. Mathematical Programming 98, 23-47 (2002).
6. Danna, E., Rothberg, E., Pape, C.L.: Exploiting relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming 102, 71-90 (2005).
7. Duran, M., Grossmann, I.: An outer-approximation algorithm for a class of mixedinteger nonlinear programs. Mathematical Programming 36, 307-339 (1986).
8. Bonami, P., Cornuéjols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Mathematical Programming 119, 331-352 (2009).
9. Abhishek, K.: Topics in Mixed Integer Nonlinear Programming. PhD thesis, Lehigh University (2008).
10. Bonami, P., Gonçalves, J.: Primal heuristics for mixed integer nonlinear programs. Technical report, IBM Research Report RC24639 (2008).
11. Vavasis, S.: Nonlinear Optimization: Complexity Issues. Oxford University Press, Oxford (1991).
12. Liberti, L., Nannicini, G., Mladenovic, N.: A good recipe for solving MINLPs. In: Maniezzo, V., Stützle, T., Voß, S. (eds.) Matheuristics. Annals of Information Systems, vol. 10, pp. 231-244. Springer, US (2008).
13. Nannicini, G., Belotti, P., Liberti, L.: A local branching heuristic for MINLPs. ArXiv, paper 0812.2188 (2009).
14. Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming 66, 327-349 (1994).
15. Fletcher, R., Leyffer, S.: Numerical experience with lower bounds for MIQP branchand- bound. SIAM Journal of Optimization 8, 604-616 (1998).
16. Westerlund, T., Pörn, R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optimization and Engineering 3, 235-280 (2002).
17. Westerlund, T.: Some transformation techniques in global optimization. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, pp. 45-74. Springer, Berlin (2006).
18. ARKI Consulting and Development. SBB Release Notes (2002).
19. Abhishek, K., Leyffer, S., Linderoth, J.: FilMINT: An outer-approximation based solver for nonlinear mixed-integer programs. Technical report, Argonne National Laboratory (2007).
20. Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Technical report, DEI, University of Padova (September 2008).
21. Schoen, F.: Two-phase methods for global optimization. In: Pardalos, P., Romeijn, H. (eds.) Handbook of Global Optimization, vol. 2, pp. 151-177. Kluwer Academic Publishers, Dordrecht (2002).
22. Fourer, R., Gay, D., Kernighan, B.: AMPL: A Modeling Language for Mathematical Programming, 2nd edn. Duxbury Press/Brooks/Cole Publishing Co. (2003).
23. Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming 106, 25-57 (2006).
24. Ilog-Cplex (v. 11.0), http://www.ilog.com/products/cplex.
25. D'Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: On Interval-subgradient and No-good Cuts. Technical report, Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna (2009).
26. Liberti, L., Cafieri, S., Tarissan, F.: Reformulations in mathematical programming: a computational approach. In: Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence. SCI, vol. 3, pp. 153-234. Springer, Berlin (2009).
27. Liberti, L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, pp. 211-262. Springer, Berlin (2006).
28. Bussieck, M., Drud, A., Meeraus, A.: MINLPLib - a collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing 15, 114- 119 (2003).