An optimal algorithm for an outerplanar facility location problem with improved time complexity

DOI10.1134/S0081543818090092zbMath1417.90042OpenAlexW2921938183MaRDI QIDQ2424182

E. Kh. Gimadi

Publication date: 24 June 2019

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543818090092

zbMATH Keywords

networkconnectednesstime complexityoptimal algorithmfacility location problemouterplanar graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Cites Work

• Solving the uncapacited plant location problem on trees
• Solving covering problems and the uncapacitated plant location problem on trees
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• The Recognition of Series Parallel Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal algorithm for an outerplanar facility location problem with improved time complexity