Continuous facility location on graphs
From MaRDI portal
Publication:2118124
DOI10.1007/S10107-021-01646-XzbMATH Open1489.90155OpenAlexW4225991975MaRDI QIDQ2118124FDOQ2118124
Authors: Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger 
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01646-x
Recommendations
- Continuous facility location on graphs
- Facility location problems on graphs with non-convex neighborhoods
- Clustering through continuous facility location problems
- Facility location via continuous optimization with discontinuous objective functions
- On a connection between facility location and perfect graphs
- Continuous maximal covering location problems with interconnected facilities
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
- Establishing Continuity of Certain Optimal Parametric Facility Location Trajectories
- Efficiency for continuous facility location problems with attraction and repulsion
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- Paths, Trees, and Flowers
- Title not available (Why is that?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Fixed-Parameter Tractability and Completeness I: Basic Results
- On the Continuous Fermat-Weber Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Obnoxious Facility Location on Graphs
- New Results on the Complexity of p-Centre Problems
- Threshold dominating sets and an improved characterization of \(W[2]\)
- Dispersing obnoxious facilities on a graph
Cited In (5)
- Dispersing obnoxious facilities on a graph
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Continuous facility location on graphs
- Establishing Continuity of Certain Optimal Parametric Facility Location Trajectories
- On the complexity of the upgrading version of the maximal covering location problem
This page was built for publication: Continuous facility location on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118124)
