Subdrop: A modified drop heuristic for location problems

DOI10.1016/0966-8349(96)00003-4MaRDI QIDQ4229659zbMATH OpenOpenAlexFDO

Authors

Publication date 22 February 1999

Published in Location Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0966-8349(96)00003-4

zbMATH Keywords

\(p\)-median problemdrop heuristiclocation

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• A perturbation heuristic for a class of location problems
• Heuristic Methods for Location-Allocation Problems
• Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location
• A Dual-Based Add Heuristic for Uncapacitated Facility Location
• Add/drop procedures for the capacitated plant location problem

Cited in

(4)

• A new heuristic for solving the \(p\)-median problem in the plane
• New local searches for solving the multi-source Weber problem
• Defining tabu list size and aspiration criterion within tabu search methods
• The \(p\)-median problem: a survey of metaheuristic approaches

This page was built for publication: Subdrop: A modified drop heuristic for location problems

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