Facility location on a tree with maximum distance constraints

DOI10.1016/0305-0548(94)00079-NzbMath0854.90091OpenAlexW1981372308MaRDI QIDQ1919972

Douglas I. Moon, Lee Papayanopoulos

Publication date: 19 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00079-n

zbMATH Keywords

tree networkidentical facilitiesminimum number of feasible locationstree-reducing procedure

Mathematics Subject Classification ID

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

Related Items (7)

A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ Covering problem on fuzzy graphs and its application in disaster management system ⋮ An efficient algorithm to solve the conditional covering problem on trapezoid graphs ⋮ On conditional covering problem ⋮ The conditional covering problem on unweighted interval graphs with nonuniform coverage radius ⋮ Efficient algorithms for the conditional covering problem ⋮ A new method for solving capacitated location problems based on a set partitioning approach

Cites Work

• Conditional covering: greedy heuristics and computational results
• On eliminating vertices from a tree
• An Analysis of Network Location Problems with Distance Constraints
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Convex Location Problems on Tree Networks
• Distance Constraints for Tree Network Multifacility Location Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

This page was built for publication: Facility location on a tree with maximum distance constraints