On a connection between facility location and perfect graphs
DOI10.1016/J.ORL.2014.08.005zbMATH Open1408.90159OpenAlexW2049900951MaRDI QIDQ1785286FDOQ1785286
Authors: Mourad Baïou, Francisco Barahona 
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.08.005
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Extremal problems in graph theory (05C35) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- On certain polytopes associated with graphs
- Title not available (Why is that?)
- The strong perfect graph theorem
- Recognizing Berge graphs
- Blocking and anti-blocking pairs of polyhedra
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Perfect zero–one matrices
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- On the facets of the simple plant location packing polytope
- Title not available (Why is that?)
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- On the integrality of some facility location polytopes
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
- On the linear relaxation of the \(p\)-median problem
- On the \(p\)-median polytope
Cited In (5)
This page was built for publication: On a connection between facility location and perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785286)
