A graph theoretical bound for the p-median problem

DOI10.1016/0377-2217(81)90202-2zbMath0451.90041OpenAlexW1966940837MaRDI QIDQ1148208

Roberto Diéguez Galvão

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90202-2

zbMATH Keywords

arborescencesp-median problemgraph theoretical boundminisum network locationshortest spanning trees

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (2)

Strengthening the reliability fixed-charge location model using clique constraints ⋮ A note on Galvao's A graph theoretical bound for the p-median problem

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A Dual-Bounded Algorithm for the p-Median Problem
• Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem
• A New Algorithm for Locating Sources Among Destinations
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median

This page was built for publication: A graph theoretical bound for the p-median problem