Publication | Closed Access
State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
91
Citations
0
References
1993
Year
Mathematical ProgrammingEngineeringConstrained OptimizationComputational ComplexityBranch And CutNonlinear 0–1Nonlinear ProgramsOperations ResearchNonlinear ProgrammingSystems EngineeringCombinatorial OptimizationOptimizationLinear OptimizationNonlinear ConstraintsInteger OptimizationComputer ScienceInteger ProgrammingQuadratic ProgrammingEnumerative MethodsLinear Programming
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.