scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198712)34:6<775::AID-NAV3220340603>3.0.CO;2-N" /><775::AID-NAV3220340603>3.0.CO;2-N 10.1002/1520-6750(198712)34:6<775::AID-NAV3220340603>3.0.CO;2-NzbMath0648.90026MaRDI QIDQ3793913

G. Handler, Reuven Chen

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relaxed problemset-coveringminimax location-allocationp-center problem on a network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (10)

A scalable exact algorithm for the vertex \(p\)-center problem ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ Location and layout planning. A survey ⋮ Algorithms for the m-center problems: A survey ⋮ 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 relaxation-based algorithm for solving the conditional \(p\)-center problem ⋮ Spherical minimax location problem using the Euclidean norm: Formulation and optimization ⋮ The conditional \(p\)-dispersion problem ⋮ A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem

This page was built for publication: