On the \(p\)-median polytope

DOI10.1007/s101070000188zbMath0992.90072MaRDI QIDQ5930734

Pasquale Avella, Antonio Sassano

Publication date: 3 October 2001

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

zbMATH Keywords

\(p\)-median polytope\(p\)-median problemdirected graphintegral slicestable set polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (25)

Projecting the flow variables for hub location problems ⋮ Polyhedral analysis for concentrator location problems ⋮ Solving the \(p\)-median problem with a semi-Lagrangian relaxation ⋮ An optimization model for trim loss minimization in an automotive glass plant ⋮ Computational study of large-scale \(p\)-median problems ⋮ Polyhedral properties of the \(K\)-median problem on a tree ⋮ Discrete location for bundled demand points ⋮ A Branch Decomposition Algorithm for the p-Median Problem ⋮ On the linear relaxation of the \(p\)-median problem ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ On the Location and p-Median Polytopes ⋮ The location-dispatching problem: polyhedral results and content delivery network design ⋮ The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory ⋮ On the \(p\)-median polytope of \(Y\)-free graphs ⋮ On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs ⋮ A large class of facets for the \(K\)-median polytope ⋮ A branch-and-cut algorithm for the median-path problem ⋮ Unnamed Item ⋮ A branch and cut algorithm for hub location problems with single assignment ⋮ A tighter formulation of the \(p\)-median problem ⋮ A family of facets for the uncapacitated \(p\)-median polytope ⋮ On a connection between facility location and perfect graphs ⋮ The Ring Star Problem: Polyhedral analysis and exact algorithm ⋮ On cutting planes for cardinality-constrained linear programs ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks

This page was built for publication: On the \(p\)-median polytope