A large class of facets for the \(K\)-median polytope

DOI10.1007/S10107-009-0301-XzbMath1229.90102OpenAlexW2087109464MaRDI QIDQ543406

Marc E. Posner, Wen-Hui Zhao

Publication date: 17 June 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0301-x

zbMATH Keywords

extreme directionpolyhedral descriptionde Faria facetsde Vries facetsprojection cone

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Polyhedral properties of the \(K\)-median problem on a tree
• The distance-domination numbers of trees
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• On the \(p\)-median polytope
• A family of facets for the uncapacitated \(p\)-median polytope

This page was built for publication: A large class of facets for the \(K\)-median polytope