## Adapting polyhedral properties from facility to hub location problems

- Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn
- Discrete Applied Mathematics
- 2004

Highly Influenced

@article{Cornujols1982SomeFO, title={Some facets of the simple plant location polytope}, author={G{\'e}rard Cornu{\'e}jols and Jean-Michel Thizy}, journal={Math. Program.}, year={1982}, volume={23}, pages={50-74} }

- Published 1982 in Math. Program.
DOI:10.1007/BF01583779

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

Showing 1-10 of 10 references

Highly Influential

Highly Influential