Primal separation algorithms

Letchford, A. N. and Lodi, A. (2003) Primal separation algorithms. 4OR: A Quarterly Journal of Operations Research, 1 (3). pp. 209-224. ISSN 1619-4500

Full text not available from this repository.


Given an integer polyhedron P ⊂ R^n, an integer point x in P, and a point x* in R^n \ P, the primal separation problem is the problem of finding a linear inequality which is valid for P, violated by x*, and satisfied at equality by x. The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for several well known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.

Item Type:
Journal Article
Journal or Publication Title:
4OR: A Quarterly Journal of Operations Research
Uncontrolled Keywords:
?? integer programmingcutting planesseparationprimal algorithmsknapsack problemstable set problemtravelling salesman problemmanagement information systemscomputational theory and mathematicstheoretical computer sciencediscipline-based research ??
ID Code:
Deposited By:
Deposited On:
11 Jul 2011 18:03
Last Modified:
15 Jul 2024 11:49