A distance constrained \(p\)-facility location problem on the real line

DOI10.1007/BF01581145zbMath0813.90077MaRDI QIDQ1340058

Arie Tamir

Publication date: 30 May 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

distance constraintsdistance constrained \(p\)-facility location problemminimum cut problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (2)

A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand ⋮ Capacitated location-allocation problems on a line

Cites Work

• Unnamed Item
• Unnamed Item
• A new approach to the maximum-flow problem
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Distance Constraints for Tree Network Multifacility Location Problems
• Solving Structured Multifacility Location Problems Efficiently

This page was built for publication: A distance constrained \(p\)-facility location problem on the real line