Rounding-based heuristics for nonconvex MINLPs

Mathematical Programming Computation

Volumn 4, Issue 1, 2012, Pages 1-31

  Nannicini, Giacomo ^a,b   Belotti, Pietro ^c  

^a SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c CLEMSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; FEASIBLE SOLUTION; LINEAR CONSTRAINTS; LOCAL BRANCHING; MIXED INTEGER LINEAR PROGRAM; MIXED INTEGER NONLINEAR PROGRAM; NON-LINEAR CONSTRAINTS; NONLINEAR PROGRAMS;

MATHEMATICAL PROGRAMMING; SOFTWARE ENGINEERING;

INTEGER PROGRAMMING;

EID: 84867509591     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-011-0032-x     Document Type: Article

References (31)

1. Balas E., Jeroslow R.: Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23(1), 61-69 (1972).
2. Belotti, P.: Couenne: a user's manual. Tech. Rep., Lehigh University (2009). http://www. coin-or. org/Couenne.
3. 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).
4. Biegler L., Grossmann I., Westerberg A.: Systematic Methods of Chemical Process Design. Prentice Hall, Upper Saddle River (NJ) (1997).
5. Bonami P., Cornuéjols G., Lodi A., Margot F.: A feasibility pump for Mixed Integer Nonlinear Programs. Math. Program. 119(2), 331-352 (2009).
6. Bonami, P., Gonçalves, J.: Primal heuristics for mixed-integer nonlinear programs. Tech. Rep. RC24639, IBM (2008).
7. 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.
8. D'Ambrosio, C.: Application oriented Mixed Integer Nonlinear Programming. Ph. D. thesis, DEIS, Università di Bologna (2009).
9. D'Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: Experiments with 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).
10. D'Ambrosio C., Frangioni A., Liberti L., Lodi A.: On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5), 341-345 (2010).
11. Danna E., Rothberg E., Le Pape C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. A 102, 71-90 (2005).
12. Fischetti M., Glover F., Lodi A.: The feasibility pump. Math. Program. A 104(1), 91-104 (2005).
13. Fischetti M., Lodi A.: Local branching. Math. Program. 98, 23-37 (2003).
14. Floudas C.: Global optimization in design and control of chemical process systems. J. Process Control 10, 125-134 (2001).
15. Glover F. W.: Tabu search-part I. ORSA J. Comput. 1(3), 190-206 (1989).
16. Hansen P., Mladenović N.: Variable neighbourhood search: principles and applications. Eur. J. Oper. Res. 130, 449-467 (2001).
17. IBM ILOG: IBM ILOG CPLEX 12. 1 User's Manual. IBM ILOG, Gentilly, France (2010).
18. Kilinç Karzan F., Nemhauser G. L., Savelsbergh M. W. P.: Information-based branching schemes for binary linear mixed-integer programs. Math. Program. Comput. 1, 249-293 (2009).
19. Liberti, L., Mladenović, N., Nannicini, G.: A good recipe for solving MINLPs. Math. Program. Comput. (2011). doi: 10. 1007/s12532-011-0031-y.
20. Lindo Systems: LINDO Solver Suite: user manual. http://www. gams. com/solvers/lindoglobal. pdf.
21. McCormick G.: Computability of global solutions to factorable nonconvex programs: Part i-convex underestimating problems. Math. Program. 10, 146-175 (1976).
22. Nannicini, G., Belotti, P.: Rounding-based heuristics for nonconvex MINLPs. In: Bonami, P., Liberti, L., Miller, A., Sartenaer, A. (eds.) Proceedings of the European Workshop on MINLP. CIRM, Marseille, France (2010).
23. Nannicini, G., Belotti, P., Liberti, L.: A local branching heuristic for MINLPs. Tech. Rep. 0812. 2188 (2008). http://arxiv. org/abs/0812. 2188.
24. Nemhauser G., Wolsey L.: Integer and Combinatorial Optimization. Wiley, New York (1988).
25. Sahinidis N.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201-205 (1996).
26. Shectman J., Sahinidis N.: A finite algorithm for global minimization of separable concave programs. J. Glob. Optim. 12, 1-36 (1998).
27. Smith, E.: On the optimal design of continuous processes. Ph. D. thesis, Imperial College of Science, Technology and Medicine, University of London (1996).
28. 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).
29. Tawarmalani M., Sahinidis N.: Global optimization of mixed integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563-591 (2004).
30. 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).
31. Wolsey L.: Integer Programming. Wiley, New York (1998).