scientific article; zbMATH DE number 2114494

MaRDI QIDQ4826164zbMATH OpenFDO

Authors Stefan Voß

Publication date 11 November 2004

zbMATH Keywords

tabu search\(p\)-median problemreverse elimination method

Mathematics Subject Classification ID

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

Recommendations

• An efficient tabu search procedure for the p-median problem
• Variable neighborhood search for the p-median
• A new heuristic approach for the P-median problem
• Fast primal and dual heuristics for the \(p\)-median location problem
• New heuristic algorithms for solving the planar p-median problem

Cited in

(12)

• The \(p\)-median problem: a survey of metaheuristic approaches
• Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
• Defining tabu list size and aspiration criterion within tabu search methods
• Variable neighborhood search: Principles and applications
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
• Location and layout planning. A survey
• A fast swap-based local search procedure for location problems
• New local searches for solving the multi-source Weber problem
• An effective heuristic for the \(P\)-median problem with application to ambulance location
• A decision support model for staff allocation of mobile medical service
• The reversal median problem

This page was built for publication:

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