Nonlinear 0–1 programming: II. Dominance relations and algorithms

DOI10.1007/BF02591797zbMath0553.90068OpenAlexW1997993610MaRDI QIDQ3216431

Joseph B. Mazzola, Egon Balas

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591797

zbMATH Keywords

linearizationdominancecomputational experiencecompact linear equivalentgeneralized covering inequalitiesmultilinear 0-1 programnonlinear 0-1 programming algorithmstrengthening 0-1 inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Boolean programming (90C09)

Related Items

On the number of local maxima in quadratic 0-1 programs, An ordering (enumerative) algorithm for nonlinear \(0-1\) programming, A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope, An algorithm for indefinite integer quadratic programming, Strong valid inequalities for Boolean logical pattern generation, Nonlinear 0–1 programming: I. Linearization techniques, Roof duality for polynomial 0–1 optimization, Upper-bounds for quadratic 0-1 maximization, Lagrangean decomposition for integer nonlinear programming with linear constraints, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, A survey of algorithms for the generalized assignment problem, Pseudo-Boolean optimization, A revised Taha's algorithm for polynomial 0-1 programming, Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems, A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation, The basic algorithm for pseudo-Boolean programming revisited, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, A constrained nonlinear 0-1 program for data allocation

Cites Work

• Unnamed Item
• Covering Relaxation for Positive 0-1 Polynomial Programs
• Nonlinear 0–1 programming: I. Linearization techniques
• Pivot and Complement–A Heuristic for 0-1 Programming
• Testing for Vision Loss in Glaucoma Suspects
• Technical Note—Generalized Covering Relaxation for 0-1 Programs
• An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
• Facets of the knapsack polytope
• Capital Expenditure Programming and Some Alternative Approaches to Risk
• Canonical Cuts on the Unit Hypercube
• Cluster Analysis and Mathematical Programming
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• Modular Design—A Special Case in Nonlinear Programming