The m-Center Problem: Minimax Facility Location

DOI10.1287/MNSC.23.10.1133MaRDI QIDQ4146582zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.23.10.1133

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(16)

• Locational analysis
• An algorithm for the bottleneck generalized assignment problem
• The stochastic bottleneck linear programming problem
• A surrogate heuristic for set covering problems
• Heuristic methods and applications: A categorized survey
• The stratified p-center problem
• Minimax models for capacitated p-center problem in uncertain environment
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
• Double bound method for solving the p-center location problem
• Bottleneck linear programming
• The Variance Location Problem on a Network with Continuously distributed demand
• scientific article; zbMATH DE number 7625156 (Why is no real title available?)
• Discrete center problems
• Exact solution approaches for the discrete α‐neighbor p‐center problem
• A rounding and clustering-based exact algorithm for the p-center problem
• A note on the m-center problem with rectilinear distances

This page was built for publication: The m-Center Problem: Minimax Facility Location

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