Technical Note—An Algorithm for the p-Median Problem

Cited in

(38)

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

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)