State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
Pierre Hansen, Brigitte Jaumard, Vincent Mathon
ORSA Journal on Computing · 1993 · Volume 5 · Issue 2
Abstract
We consider nonlinear programs in 0–1 variables with nonlinear constraints and survey the main approaches to their solution: (i) linearization; (ii) algebraic methods; (iii) enumerative methods and (iv) cutting-plane methods. We also present an extensive computational comparison of algorithms of all four categories. Enumerative methods appear to be the most promising. INFORMS Journal on Computing , ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Keywords
integer programming, nonlinear 0–1 programming, linearization, variable elimination, cutting plane, branch-and-bound
Enable JavaScript for citation tools and additional paper interactions.