Primal separation algorithms


Given an integer polyhedron PI ⊂ R, an integer point x̄ ∈ PI , and a point x∗ ∈ R \ PI , the primal separation problem is the problem of finding a linear inequality which is valid for PI , 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 wellknown classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.

DOI: 10.1007/s10288-003-0012-8

Extracted Key Phrases

Cite this paper

@article{Letchford2003PrimalSA, title={Primal separation algorithms}, author={Adam N. Letchford and Andrea Lodi}, journal={4OR}, year={2003}, volume={1}, pages={209-224} }