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.

Abstract

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: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 43713
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 18:03
Refereed?: Yes
Published?: Published
Last Modified: 22 Jun 2019 03:49
URI: https://eprints.lancs.ac.uk/id/eprint/43713

Actions (login required)

View Item View Item