Securely Connected Facility Location in Metric Graphs

DOI10.1007/978-3-642-20009-0_46zbMath1421.90075OpenAlexW71437775MaRDI QIDQ5232830

Andreas Bley, Maren Martens

Publication date: 13 September 2019

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20009-0_46

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• On the relationship between the biconnectivity augmentation and traveling salesman problems
• An exact algorithm for solving the ring star problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

This page was built for publication: Securely Connected Facility Location in Metric Graphs