Unconstrained 0-1 optimization and Lagrangean relaxation
From MaRDI portal
Publication:2277361
DOI10.1016/0166-218X(90)90139-4zbMath0725.90067MaRDI QIDQ2277361
Warren E. Adams, Alain Billionnet, Alain Sutter
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Lagrangean relaxationpolynomial optimizationequivalent problemroof duality gapunconstrained 0-1 polynomial programming
Related Items
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope, A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem, Best reduction of the quadratic semi-assignment problem, Pseudo-Boolean optimization, A linearization framework for unconstrained quadratic (0-1) problems, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, ``Miniaturized linearizations for quadratic 0/1 problems
Cites Work
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Roof duality for polynomial 0–1 optimization
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- A Selection Problem of Shared Fixed Costs and Network Flows
