Continuous facility location on graphs

DOI10.1007/978-3-030-45771-6_14MaRDI QIDQ5041743zbMATH OpenOpenAlexFDO

Authors Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

Publication date 14 October 2022

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-45771-6_14

zbMATH Keywords

graph theorylocation theoryparametrized complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Continuous facility location on graphs
• Dispersing obnoxious facilities on a graph
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• A minimum length covering subgraph of a network
• On the Solution Value of the Continuous p-Center Location Problem on a Graph

Cites work

• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Dispersing Obnoxious Facilities on a Graph
• 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?)
• New Results on the Complexity of p-Centre Problems
• On the Continuous Fermat-Weber Problem
• Paths, Trees, and Flowers

Cited in

(4)

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

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 Q5041743)