Continuous facility location on graphs

DOI10.1007/S10107-021-01646-XMaRDI QIDQ2118124zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10107-021-01646-x

zbMATH Keywords

graph theorycomplexitycoveringlocation theoryparametrized complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

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

Cites work

• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Dispersing obnoxious facilities on a graph
• Fixed-Parameter Tractability and Completeness I: Basic Results
• New Results on the Complexity of p-Centre Problems
• Obnoxious Facility Location on Graphs
• On the Continuous Fermat-Weber Problem
• Paths, Trees, and Flowers
• Threshold dominating sets and an improved characterization of \(W[2]\)

Cited in

(5)

• Continuous facility location on graphs
• Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
• On the complexity of the upgrading version of the maximal covering location problem
• Establishing Continuity of Certain Optimal Parametric Facility Location Trajectories
• Dispersing obnoxious facilities on a graph

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)