Letchford, A. N. and Lodi, A. (2003) Primal separation algorithms. 4OR: A Quarterly Journal of Operations Research, 1 (3). pp. 209-224. ISSN 1619-4500Full 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.
|Journal or Publication Title:||4OR: A Quarterly Journal of Operations Research|
|Uncontrolled Keywords:||integer programming ; cutting planes ; separation ; primal algorithms ; knapsack problem ; stable set problem ; travelling salesman problem|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||11 Jul 2011 19:03|
|Last Modified:||24 Jan 2017 01:59|
Actions (login required)