On the linear relaxation of the \(p\)-median problem
From MaRDI portal
Publication:429694
DOI10.1016/j.disopt.2010.12.002zbMath1242.90272OpenAlexW1971059215MaRDI QIDQ429694
Mourad Baïou, Francisco Barahona
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.12.002
Related Items
On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs, On a connection between facility location and perfect graphs
Cites Work
- Polyhedral properties of the \(K\)-median problem on a tree
- The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory
- On the \(p\)-median polytope of \(Y\)-free graphs
- Solving the plant location problem on a line by linear programming
- An algorithm for finding a \(k\)-median in a directed tree
- On the facets of the simple plant location packing polytope
- A constant-factor approximation algorithm for the \(k\)-median problem
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Solution methods for thep-median problem: An annotated bibliography
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- On the Integrality of Some Facility Location Polytopes
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- 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
- Integer Programming: Methods, Uses, Computations
- On the \(p\)-median polytope
- A family of facets for the uncapacitated \(p\)-median polytope
