scientific article; zbMATH DE number 2114494
From MaRDI portal
Publication:4826164
zbMath1176.90365MaRDI QIDQ4826164
Publication date: 11 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (11)
The \(p\)-median problem: a survey of metaheuristic approaches ⋮ Location and layout planning. A survey ⋮ Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem ⋮ An effective heuristic for the \(P\)-median problem with application to ambulance location ⋮ New local searches for solving the multi-source Weber problem ⋮ A decision support model for staff allocation of mobile medical service ⋮ A fast swap-based local search procedure for location problems ⋮ Variable neighborhood search: Principles and applications ⋮ Defining tabu list size and aspiration criterion within tabu search methods ⋮ 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
This page was built for publication:
