On the Asymmetric Connected Facility Location Polytope
From MaRDI portal
Publication:3195346
DOI10.1007/978-3-319-09174-7_32zbMath1451.90088OpenAlexW127968809WikidataQ57705364 ScholiaQ57705364MaRDI QIDQ3195346
Markus Leitner, Markus Sinnl, Juan-José Salazar-González, Ivana Ljubić
Publication date: 16 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_32
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (4)
Approximate robust optimization for the connected facility location problem ⋮ The connected facility location polytope ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ An algorithmic framework for the exact solution of tree-star problems
This page was built for publication: On the Asymmetric Connected Facility Location Polytope
