Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
DOI10.1016/J.COR.2004.04.009zbMATH Open1146.90460DBLPjournals/cor/PachecoC05OpenAlexW2052373803WikidataQ59760349 ScholiaQ59760349MaRDI QIDQ2387294FDOQ2387294
Joaquín Pacheco, Silvia Casado
Publication date: 2 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.009
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing approximate solutions of the maximum covering problem with GRASP
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Fundamentals of scatter search and path relinking
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- A probabilistic heuristic for a computationally difficult set covering problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Variable neighborhood search for the p-median
- Solving capacitated clustering problems
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- A GRASP with path-relinking for private virtual circuit routing
- An experimental evaluation of a scatter search for the linear ordering problem
- Minimizing labor requirements in a periodic vehicle loading problem
Cited In (13)
- Metaheuristic applications on discrete facility location problems: a survey
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- Memetic algorithms
- Approximability results for the $p$-centdian and the converse centdian problems
- Path relinking approach for multiple allocation hub maximal covering problem
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Scatter search for an uncapacitated \(p\)-hub median problem
- Bee colony optimization for the \(p\)-center problem
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
- A MILP formulation for the reorganization of the blood supply chain in Italian regions
Uses Software
This page was built for publication: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387294)
