Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works

DOI10.1016/S0305-0548(01)00033-8zbMath0994.90113OpenAlexW2046018684MaRDI QIDQ1603329

M. John Hodgson, Kenneth E. Rosing

Publication date: 11 July 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00033-8

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (11)

Multiple allocation hub-and-spoke network design under hub congestion ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ Solving the maximal covering location problem with heuristic concentration ⋮ Solving the hub location problem with modular link capacities ⋮ A scatter search-based heuristic to locate capacitated transshipment points ⋮ The heuristic concentration-integer and its application to a class of location problems ⋮ Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification ⋮ Public facility location using dispersion, population, and equity criteria ⋮ Allocating servers to facilities, when demand is elastic to travel and waiting times ⋮ Integrating location and network restoration decisions in relief networks under uncertainty ⋮ Heuristics for Location Models

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• General local search methods
• An efficient tabu search procedure for the \(p\)-median problem
• Heuristic concentration: Two stage solution construction
• Heuristic concentration and tabu search: A head to head comparison
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

This page was built for publication: Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works