On the complexity of the surrogate dual of 0–1 programming
From MaRDI portal
Publication:3725870
DOI10.1007/BF01919175zbMath0594.90061MaRDI QIDQ3725870
Publication date: 1986
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
ellipsoid algorithm; Computational results; surrogate constraints; surrogate dual of a binary linear program
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
90C09: Boolean programming
Cites Work
- The ellipsoid method and its consequences in combinatorial optimization
- Some relationships between lagrangian and surrogate duality in integer programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- Calculating surrogate constraints
- Feature Article—The Ellipsoid Method: A Survey
- Surrogate Constraint Duality in Mathematical Programming
- Discrete Programming by the Filter Method
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- An Improved Implicit Enumeration Approach for Integer Programming
- Surrogate Mathematical Programming