The m-Center Problem
From MaRDI portal
Publication:5588431
DOI10.1137/1012016zbMath0193.24204OpenAlexW2028318528MaRDI QIDQ5588431
Publication date: 1970
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1012016
Related Items
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, A scalable exact algorithm for the vertex \(p\)-center problem, Double bound method for solving the \(p\)-center location problem, A Benders decomposition based framework for solving cable trench problems, The transfer point location problem, Location and layout planning. A survey, Review, extension and prediction in emergency service siting models, Equity models in planar location, A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks, The multi-period \(p\)-center problem with time-dependent travel times, Some problems in discrete optimization, A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem, GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem, Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities, Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions, Exact solution approaches for the discrete α‐neighbor p‐center problem, A note on the m-center problem with rectilinear distances, The discrete p-dispersion problem, Algorithms for the m-center problems: A survey, The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem, The complete vertex \(p\)-center problem, Locational analysis, GRASP and VNS for solving the \(p\)-next center problem, An algorithm to evaluate public transportation stops for minimizing passenger walking distance, Unnamed Item, Maximizing the minimum cover probability by emergency facilities, Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane, New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems, A dual bounding scheme for a territory design problem, Un nuevo resultado sobre la complejidad del problema delP-centro, A relaxation-based algorithm for solving the conditional \(p\)-center problem, Location analysis: a synthesis and survey, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, Data Exploration by Representative Region Selection: Axioms and Convergence, Dominant, an algorithm for the \(p\)-center problem., Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, A historical perspective on location problems, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, An elliptical cover problem in drone delivery network design and its solution algorithms, Discrete Center Problems, A correction to the definition of local center, Polynomially bounded algorithms for locatingp-centers on a tree, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants, Minimean Location of Different Facilities on a Line Network, The zone-constrained location problem on a network, Enhancements to two exact algorithms for solving the vertex \(P\)-center problem, Demand point aggregation for planar covering location models
