The m-Center Problem: Minimax Facility Location
From MaRDI portal
Publication:4146582
DOI10.1287/mnsc.23.10.1133zbMath0369.90125OpenAlexW2119735077MaRDI QIDQ4146582
No author found.
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
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items
A surrogate heuristic for set covering problems, Double bound method for solving the \(p\)-center location problem, A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem, Exact solution approaches for the discrete α‐neighbor p‐center problem, A note on the m-center problem with rectilinear distances, Locational analysis, Unnamed Item, Bottleneck linear programming, The stratified \(p\)-center problem, An algorithm for the bottleneck generalized assignment problem, Minimax models for capacitated \(p\)-center problem in uncertain environment, Heuristic methods and applications: A categorized survey, Discrete Center Problems, The stochastic bottleneck linear programming problem, The Variance Location Problem on a Network with Continuously distributed demand
