On the Location and p-Median Polytopes
From MaRDI portal
Publication:2971602
DOI10.1007/978-3-540-76796-1_1zbMath1359.90055OpenAlexW128742773MaRDI QIDQ2971602
Mourad Baïou, Francisco Barahona
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_1
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory
- On the \(p\)-median polytope of \(Y\)-free graphs
- On certain polytopes associated with graphs
- An algorithm for finding a \(k\)-median in a directed tree
- On the facets of the simple plant location packing polytope
- The approximation gap for the metric facility location problem is not yet closed
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- On a Class of Totally Unimodular Matrices
- Structural properties and recognition of restricted and strongly unimodular matrices
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Transitive Packing: A Unifying Concept in Combinatorial Optimization
- On the \(p\)-median polytope
- A family of facets for the uncapacitated \(p\)-median polytope
