A recipe for finding good solutions to MINLPs

Mathematical Programming Computation

Volumn 3, Issue 4, 2011, Pages 349-390

  Liberti, Leo ^a   Mladenović, Nenad ^b   Nannicini, Giacomo ^c,d  

^a ECOLE POLYTECHNIQUE   (France)

^b BRUNEL UNIVERSITY   (United Kingdom)

^c SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; NONLINEAR PROGRAMMING;

EXACT METHODS; INTEGER-NONLINEAR PROGRAMMING; LOCAL BRANCHING; NONCONVEX; NONLINEAR PROGRAMMING ALGORITHM; SEARCH TOOLS; SPECIFIC PROBLEMS; VARIABLE NEIGHBORHOOD SEARCH;

HEURISTIC METHODS;

EID: 84868617000     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-011-0031-y     Document Type: Article

References (51)

1. Abhishek, K., Leyffer, S., Linderoth, J.: Filmint: An outer-approximation based solver for nonlinear mixed-integer programs. Technical report ANL/MCS-P1374-0906, Argonne National Laboratory (2007)
2. Adjiman, C., Androulakis, I., Floudas, C.:Global optimization ofMINLP problems in process synthesis and design. Comput. Chem. Eng. 21, S445-S450 (1997)
3. Aouchiche, M., Bonnefoy, J., Fidahoussen, A., Caporossi, G., Hansen, P., Hiesse, L., Lacheré, J., Monhait, A.: VNS for extremal graphs 14: The AGX 2 system. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, pp. 281-308. Springer, Berlin (2006)
4. Belotti, P.: Couenne: a user's manual. Technical report, Lehigh University (2009). http://www.coin-or. org/Couenne
5. Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4-5), 597-634 (2008)
6. Bonami, P., Biegler, L., Conn, A., Cornuéjols, G., Grossmann, I., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An algorithmic framework for convex Mixed Integer Nonlinear Programs. Technical report RC23771. IBM Corporation (2005)
7. Bonami, P., Cornuéjols, G., Lodi, A., Margot, F.: A feasibility pump for Mixed Integer Nonlinear Programs. Math. Program. 119(2), 331-352 (2009)
8. Bonami, P., Lee, J.: BONMIN user's manual. Technical report. IBM Corporation (2007)
9. Brimberg, J., Hansen, P., Mladenovíc, N.: Attraction probabilities in variable neighborhood search. 4OR 8, 181-194 (2010)
10. Brimberg, J., Mladenovíc, N.:Avariable neighbourhood algorithm for solving the continuous locationallocation problem. Stud. Location Anal. 10, 1-12 (1996)
11. Brook, A., Kendrick, D., Meeraus, A.: Gams, a user's guide. ACMSIGNUM Newslett. 23(3-4), 10-11 (1988)
12. Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib-a collection of test models for Mixed-Integer Nonlinear Programming. INFORMS J. Comput. 15(1) (2003). http://www.gamsworld.org/minlp/ minlplib.htm
13. Consulting, A., Development: SBB Release Notes (2002)
14. D'Ambrosio, C.: Application oriented Mixed Integer Nonlinear Programming. Ph.D. thesis, DEIS, Università di Bologna (2009)
15. D'Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: Experimentswith a Feasibility Pump approach for nonconvex MINLPs. In: Festa, P. (ed.) Proceedings of the 9th Symposium on Experimental Algorithms (SEA 2010). Lecture Notes in Computer Science, vol. 6049. Springer, Berlin (2010)
16. D'Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of Feasibility Pumps for nonconvex MINLP. Technical report OR-10-13, DEIS, Università di Bologna (2010)
17. Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. A 102, 71-90 (2005)
18. Dražic, M., Kovǎcevíc-Vuǰcíc, V., Čangalovíc, M., Mladenovíc, N.: Glob-a new VNS-based software for global optimization. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, pp. 135-154. Springer, Berlin (2006)
19. Drazíc, M., Lavor, C., Maculan, N., Mladenovíc, N.: A continuous VNS heuristic for finding the tridimensional structure of a molecule (2004)
20. Duran, M., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307-339 (1986)
21. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. A 104(1), 91-104 (2005)
22. Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23-37 (2003)
23. Fletcher, R., Leyffer, S.: Solving Mixed Integer Nonlinear Programs by outer approximation. Math. Program. 66, 327-349 (1994)
24. Fletcher, R., Leyffer, S.: Numerical experience with lower bounds forMIQP branch-and-bound. SIAM J. Optim. 8(2), 604-616 (1998)
25. Fletcher, R., Leyffer, S.: User manual for filter. Technical report, University of Dundee, UK (1999)
26. Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239-269 (2002)
27. Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)
28. Hansen, P., Mladenovíc, N.: Variable neighbourhood search: principles and applications. Eur. J. Oper. Res. 130, 449-467 (2001)
29. Hansen, P., Mladenovíc, N., Brimberg, J., Moreno Pérez, J.: Variable neighbourhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, 2nd edn., Kluwer, Dordrecht (2010)
30. Hansen, P., Mladenovíc, N., Moreno Pérez, J.: Variable neighbourhood search: methods and applications. 4OR 6, 319-360 (2008)
31. Hansen, P., Mladenovíc, N., Uroševíc, D.:Variable neighbourhood search and local branching. Comput. Oper. Res. 33(10), 3034-3045 (2006)
32. Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4(4), 373-395 (1984)
33. Lavor, C., Liberti, L., Maculan, N.: Computational experience with the molecular distance geometry problem. In: Pintér, J. (ed.) Global Optimization: Scientific and Engineering Case Studies, Springer, Berlin (2006)
34. Leyffer, S.: User manual for MINLP_BB. Technical report, University of Dundee, UK (1999)
35. Liberti, L.:Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, pp. 211-262. Springer, Berlin (2006)
36. Liberti, L., Cafieri, S., Savourey, D.: Reformulation optimization software engine. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) Mathematical Software. LNCS, vol. 6327, pp. 303-314. Springer, New York (2010)
37. Liberti, L., Dražic, M.:Variable neighbourhood search for the global optimization of constrained NLPs. In: Proceedings of GO Workshop, Almeria, Spain (2005)
38. Liberti, L., Lavor, C., Maculan, N.: Double VNS for the molecular distance geometry problem. In: Proceedings of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)
39. Liberti, L., Lavor, C., Maculan, N., Marinelli, F.: Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Glob. Optim. (accepted)
40. Liberti, L., Maculan, N. (eds.): Global Optimization: From Theory to Implementation. Springer, Berlin (2006)
41. Liberti, L., Nannicini, G., Mladenovíc, N.: A good recipe for solving MINLPs. In: Maniezzo, V., Stützle, T., Voss, S. (eds.) Matheuristics: HybridizingMetaheuristics andMathematical Programming. Annals of Information Systems, vol. 10, pp. 231-245. Springer, Berlin (2009)
42. Mladenovíc, N., Drazic, M., Kovacevic-Vujcic, V., Cangalovic, M.: General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3), 753-770 (2008)
43. Mladenovíc, N., Petrovíc, J., Kovǎcevíc-Vuǰcíc, V., Čangalovíc, M.: Solving a spread-spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151, 389-399 (2003)
44. Nannicini, G.: Point-to-point shortest paths in dynamic time-dependent road networks. Ph.D. thesis, Ecole Polytechnique, Palaiseau, France (2009)
45. Nannicini, G., Belotti, P.: Rounding-based heuristics for nonconvex MINLPs. In: Bonami, P., Liberti, L., Miller, A., Sartenaer, A. (eds.) Proceedings of the EuropeanWorkshop on MINLP. CIRM, Marseille (2010)
46. Puchinger, J., Raidl, G.: Relaxation guided variable neighbourhood search. In: Proceedings of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)
47. Sahinidis, N.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201-205 (1996)
48. Smith, E., Pantelides, C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457-478 (1999)
49. Tawarmalani, M., Sahinidis, N.: Global optimization ofmixed integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563-591 (2004)
50. Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25-57 (2006)
51. Westerlund, T., Skrifvars, H., Harjunkoski, I., Pörn, R.: An extended cutting plane method for a class of non-convex MINLP problems. Comput. Chem. Eng. 22(3), 357-365 (1998)