The Optimum Location of Multi-centres on a Graph

DOI10.1057/JORS.1971.32MaRDI QIDQ5623709zbMATH OpenOpenAlexFDO

Authors Paolo Viola, Nicos Christofides

Publication date 1971

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1971.32

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)

Cited in

(11)

• Review, extension and prediction in emergency service siting models
• Locational analysis
• An algorithm to evaluate public transportation stops for minimizing passenger walking distance
• Double bound method for solving the p-center location problem
• Condorcet winner configurations of linear networks
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
• On alternativep-center problems
• Discrete center problems
• A Mathematical Programming Model for Optimizing a Petroleum Network of Pipelines and Depots
• Demand point aggregation for planar covering location models
• The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem

This page was built for publication: The Optimum Location of Multi-centres on a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5623709)