Polyhedral properties of the \(K\)-median problem on a tree
From MaRDI portal
Publication:879965
DOI10.1007/s10107-006-0002-7zbMath1130.90058OpenAlexW2086058434MaRDI QIDQ879965
Rakesh V. Vohra, Marc E. Posner, Sven de Vries
Publication date: 10 May 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0002-7
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, On the linear relaxation of the \(p\)-median problem, On the \(p\)-median polytope of \(Y\)-free graphs, A large class of facets for the \(K\)-median polytope
Cites Work
- Unnamed Item
- Packing and covering a tree by subtrees
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Some facets of the simple plant location polytope
- Local search heuristic for k-median and facility location problems
- On the \(p\)-median polytope
