The continuousm-center problem on a network

This publication has 12 references indexed in Scilit:

• An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
  SIAM Journal on Algebraic Discrete Methods, 1980
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
  Published by Springer Nature ,1980
• Cutting planes from conditional bounds: A new approach to set covering
  Published by Springer Nature ,1980
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
  SIAM Journal on Applied Mathematics, 1979
• Finding Two-Centers of a Tree: The Continuous Case
  Transportation Science, 1978
• Note—A Computational Survey of Methods for the Set Covering Problem
  Management Science, 1975
• Minimax Location of a Facility in an Undirected Tree Graph
  Transportation Science, 1973
• The m-Center Problem
  SIAM Review, 1970
• Letter to the Editor—A Note on a Graph Theoretic Game of Hakimi's
  Operations Research, 1967
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
  Operations Research, 1964