Technical Note—An Algorithm for the p-Median Problem

Cited In (38)

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

This page was built for publication: Technical Note—An Algorithm for the p-Median Problem

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