On the connectedness property of service areas for the Network Facility Location Problem

DOI10.1016/S1571-0653(04)00375-0zbMath1182.90054OpenAlexW2069766880MaRDI QIDQ3438964

E. Kh. Gimadi

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00375-0

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the connectedness property of service areas for the Network Facility Location Problem