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

DOI10.1007/BF02591797MaRDI QIDQ3216431zbMATH OpenOpenAlexFDO

Authors E. Balas, Joseph B. Mazzola

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

compact linear equivalentcomputational experiencedominancegeneralized covering inequalitieslinearizationmultilinear 0-1 programnonlinear 0-1 programming algorithmstrengthening 0-1 inequalities

Mathematics Subject Classification ID

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

Recommendations

• Nonlinear 0–1 programming: I. Linearization techniques
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• A class of valid inequalities for multilinear 0-1 optimization problems
• scientific article; zbMATH DE number 4008098
• \(O(n \log n)\) procedures for tightening cover inequalities

Cites work

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

Cited in

(22)

• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A survey of algorithms for the generalized assignment problem
• A constrained nonlinear 0-1 program for data allocation
• An ordering (enumerative) algorithm for nonlinear \(0-1\) programming
• Strong valid inequalities for Boolean logical pattern generation
• Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
• A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
• The basic algorithm for pseudo-Boolean programming revisited
• On the number of local maxima in quadratic 0-1 programs
• An algorithm for indefinite integer quadratic programming
• Nonlinear 0–1 programming: I. Linearization techniques
• scientific article; zbMATH DE number 4008098 (Why is no real title available?)
• Roof duality for polynomial 0–1 optimization
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• A revised Taha's algorithm for polynomial 0-1 programming
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Pseudo-Boolean optimization
• Upper-bounds for quadratic 0-1 maximization
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method

This page was built for publication: Nonlinear 0–1 programming: II. Dominance relations and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216431)