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