The complexity of cover inequality separation11This research was supported by US Army Research Office DAAH04-94-G-0017 and NSF Grant No. DMI-9700285.

Authors:
D Klabjan;G.L Nemhauser;C Tovey
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA;School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA;School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
1998

Citing 3
Cited 4

Integer and combinatorial optimization

Integer and combinatorial optimization
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Operations Research Letters

General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes

Discrete Optimization
Simple lifted cover inequalities and hard knapsack problems

Discrete Optimization
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.