Minimean Location of Different Facilities on a Line Network

DOI10.1137/0602043zbMath0489.90038OpenAlexW2069589129MaRDI QIDQ3951884

B. L. Hulme, Peter J. Slater

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602043

zbMATH Keywords

customer verticesfacility verticesm-mean median problem for a networkminimean facility location on a line networkminimization of average distance

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (2)

Partition distance in graphs ⋮ Average distance in colored graphs

Cites Work

• Unnamed Item
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Convex Location Problems on Tree Networks
• The Centers and Medians of a Graph
• The m-Center Problem
• Optimum Locations of Centers in Networks
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Minimean Location of Different Facilities on a Line Network