Some facets of the simple plant location polytope

  title={Some facets of the simple plant location polytope},
  author={G{\'e}rard Cornu{\'e}jols and Jean-Michel Thizy},
  journal={Math. Program.},
For several combinatorial optimization problems the best algorithms that exist today use information about the facial structure of the convex hull of the feasible solutions, a polytope known as the integerpolytope. The matching problem [9, 20] is an example where the integer polytope has been fully described by means of its facets. The traveling salesman problem [12, 19, 1] and the vertex packing problem [15, 16] are examples of NP-complete problems where the partial description of the integer… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 35 extracted citations


Publications referenced by this paper.
Showing 1-10 of 10 references

On certain polytopes associated with graphs

  • V. Chvatal
  • Journal of Combinatorial Theory B
  • 1975
Highly Influential
4 Excerpts

The travelling salesman polytope and {0, 2}-matchings

  • G. Cornuejols, W. R. Pulleyblank
  • Bonn workshop on combinatorial optimization…
  • 1982
1 Excerpt

Fractional vertices, cuts and facets of the simple plant location problem

  • M Guignard
  • Mathematical Programming Study
  • 1980
2 Excerpts

Christofldes, "A restricted Lagrangean approach to the travelling salesman problem

  • N. E. Balas
  • Management Sciences Research Report 439,
  • 1979
1 Excerpt

Set partitioning: A survey

  • E. Balas, M. W. Padberg
  • SIAMReview
  • 1976
3 Excerpts

Similar Papers

Loading similar papers…