On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
From MaRDI portal
Publication:1174434
DOI10.1016/0166-218X(90)90143-ZzbMath0744.90060OpenAlexW1968307541MaRDI QIDQ1174434
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(90)90143-z
Related Items
A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem, Upper-bounds for quadratic 0-1 maximization, On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), Concave extensions for nonlinear 0-1 maximization problems, Pseudo-Boolean optimization, Block linear majorants in quadratic 0--1 optimization, Unconstrained 0-1 optimization and Lagrangean relaxation, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
Cites Work
- Unnamed Item
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Roof duality for polynomial 0–1 optimization
- Methods of Nonlinear 0-1 Programming
- A Selection Problem of Shared Fixed Costs and Network Flows
