Sciweavers

ORL
1998

The complexity of cover inequality separation

13 years 9 months ago
The complexity of cover inequality separation
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that the general problem is NP-hard but a special case is solvable in linear time. c 1998 Elsevier Science B.V. All rights reserved.
Diego Klabjan, George L. Nemhauser, Craig A. Tovey
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where ORL
Authors Diego Klabjan, George L. Nemhauser, Craig A. Tovey
Comments (0)