Continuous Facility Location on Graphs

DOI10.1007/978-3-030-45771-6_14zbMath1503.90148OpenAlexW3002734782MaRDI QIDQ5041743

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

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

location theorygraph theoryparametrized complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Dispersing obnoxious facilities on a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New Results on the Complexity of p-Centre Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Dispersing Obnoxious Facilities on a Graph
• On the Continuous Fermat-Weber Problem
• Paths, Trees, and Flowers

This page was built for publication: Continuous Facility Location on Graphs