Technical Note—An Algorithm for the p-Median Problem

DOI10.1287/opre.25.4.709zbMath0372.90096OpenAlexW2034634926MaRDI QIDQ4149232

Ugonnaya I. Ogbu, Subhash C. Narula, Haakon M. Samuelsson

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.25.4.709

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)

Related Items

Principal points analysis via p-median problem for binary data, A heuristic for large-size \(p\)-median location problems with application to school location, The minimum weighted covering location problem with distance constraints, BEAMR: an exact and approximate model for the \(p\)-median problem, The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, Solving the anti-covering location problem using Lagrangian relaxation, A model for the capacitated \(p\)-facility location problem in global environments, Application of Lagrangian relaxation to computer network control, Solving the \(p\)-median problem on regular and lattice networks, A double annealing algorithm for discrete location/allocation problems, New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach, Configuration‐based approach for topological problems in the design of wireless sensor networks, A cost operator approach to multistage location-allocation, A graph theoretical bound for the p-median problem, A hybrid genetic algorithm for the Hamiltonian p‐median problem, Budget constrained location problem with opening and closing of facilities., A tree search algorithm for the p-median problem, A projection method for the uncapacitated facility location problem, A method for solving to optimality uncapacitated location problems, On the computational complexity of centers locating in a graph, Optimal partitioning of a data set based on the \(p\)-median model, A family of facets for the uncapacitated \(p\)-median polytope, Alternate solution approaches for competitive hub location problems, Affinity propagation and uncapacitated facility location problems, Lagrangean heuristics for location problems, A gamma heuristic for the \(p\)-median problem, A computational evaluation of a general branch-and-price framework for capacitated network location problems, An efficient tabu search procedure for the \(p\)-median problem, Exemplar-based clustering via simulated annealing, The simple plant location problem: Survey and synthesis, On cutting planes for cardinality-constrained linear programs, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, A comparison of two dual-based procedures for solving the p-median problem, Analyzing tradeoffs between zonal constraints and accessibility in facility location, The zone-constrained location problem on a network, 'Multidimensional' extensions and a nested dual approach for the m-median problem, A Primal Approach to the Simple Plant Location Problem