We survey recent progress in applying disjunctive programming theory for the effective solution of mixed integer nonlinear programming problems. Generation of effective cutting planes is discussed for both the convex and nonconvex cases.
P. Bonami, J. Linderoth, A. Lodi (2011). Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems. LONDON : ISTE Ltd and John Wiley & Sons Inc..
Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems
LODI, ANDREA
2011
Abstract
We survey recent progress in applying disjunctive programming theory for the effective solution of mixed integer nonlinear programming problems. Generation of effective cutting planes is discussed for both the convex and nonconvex cases.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
