The connected facility location polytope
From MaRDI portal
Publication:1686059
DOI10.1016/j.dam.2016.08.010zbMath1376.05144OpenAlexW2520143552WikidataQ57705355 ScholiaQ57705355MaRDI QIDQ1686059
Juan-José Salazar-González, Ivana Ljubić, Markus Sinnl, Markus Leitner
Publication date: 20 December 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/126354/1/CFLP_theory.pdf
Trees (05C05) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial geometries and geometric closure systems (51D20)
Related Items (3)
The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives
Cites Work
- Unnamed Item
- Unnamed Item
- Branch-and-cut-and-price for capacitated connected facility location
- MIP models for connected facility location: a theoretical and computational study
- An algorithmic framework for the exact solution of tree-star problems
- Approximation algorithms for data management in networks
- A note on the generalized Steiner tree polytope
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- The Push Tree problem
- On the Asymmetric Connected Facility Location Polytope
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
This page was built for publication: The connected facility location polytope