Fast heuristics for large scale covering-location problems
From MaRDI portal
Publication:5959388
DOI10.1016/S0305-0548(99)00088-XzbMath1001.90043MaRDI QIDQ5959388
Gilbert Laporte, Luce Brotcorne, Frédéric Semet
Publication date: 3 April 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A review on algorithms for maximum clique problems, Developing effective meta-heuristics for a probabilistic location model via experimental design, Fuzzy goal programming models for analyzing demand coverage, Covering models and optimization techniques for emergency response facility location and planning: a review, Comparative error bound theory for three location models: continuous demand versus discrete demand, A multiperiod set covering location model for dynamic redeployment of ambulances, Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network, A new model for maximal coverage exploiting GIS capabilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The p-cover problem
- A tiling and routing heuristic for the screening of cytological samples
- On the Complexity of Some Common Geometric Location Problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Solving an ambulance location model by tabu search
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
