On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
From MaRDI portal
Publication:1314325
DOI10.1016/0166-218X(92)00119-7zbMath0794.90038OpenAlexW1992162584MaRDI QIDQ1314325
P. M. Dearing, Warren P. Adams
Publication date: 3 March 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)00119-7
Related Items (21)
Mathematical Programming Models and Exact Algorithms ⋮ A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope ⋮ A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems ⋮ A column generation approach for the unconstrained binary quadratic programming problem ⋮ Upper-bounds for quadratic 0-1 maximization ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds ⋮ Reformulation of a model for hierarchical divisive graph modularity maximization ⋮ A network approach for specially structured linear programs arising in 0-1 quadratic optimization ⋮ A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) ⋮ Concave extensions for nonlinear 0-1 maximization problems ⋮ RLT insights into lift-and-project closures ⋮ Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem ⋮ Pseudo-Boolean optimization ⋮ Block linear majorants in quadratic 0--1 optimization ⋮ Unconstrained 0-1 optimization and Lagrangean relaxation ⋮ Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis ⋮ Lagrangean decompositions for the unconstrained binary quadratic programming problem ⋮ Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem ⋮ On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
Cites Work
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- 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
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Integer Programming: Methods, Uses, Computations
- An Improved Implicit Enumeration Approach for Integer Programming
- A Selection Problem of Shared Fixed Costs and Network Flows
This page was built for publication: On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
