A decomposition approach for the probabilistic maximal covering location-allocation problem
From MaRDI portal
Publication:1017444
DOI10.1016/j.cor.2008.11.015zbMath1160.90556OpenAlexW2016100020MaRDI QIDQ1017444
Francisco de Assis Corrêa, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena
Publication date: 19 May 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.015
Related Items
A hybrid method for the probabilistic maximal covering location-allocation problem, Generalized coverage: new developments in covering location models, On the fuzzy maximal covering location problem, Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems, The use of fuzzy logic in various combinatorial optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- A Lagrangean heuristic for the maximal covering location problem
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- Location science research: a review
- A branch-and-price approach to \(p\)-median location problems
- Ambulance location and relocation models.
- Conflict graphs in solving integer programming problems
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- The Maximal Covering Location Problem with Capacities on Total Workload
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- The Hierarchical Service Location Problem
- The Maximum Availability Location Problem
- Advances in Artificial Intelligence – SBIA 2004
- Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
- A Primer in Column Generation
- Evolutionary Computation in Combinatorial Optimization
- Hierarchical location-allocation models for congested systems
