A decomposition heuristic for the maximal covering location problem

DOI10.1155/2010/120756zbMath1198.90266OpenAlexW2054526717WikidataQ58650421 ScholiaQ58650421MaRDI QIDQ606191

Marcos Antonio Pereira, Edson Luiz França Senne, Luiz Antonio Nogueira Lorena

Publication date: 16 November 2010

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226346

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

Intelligent-guided adaptive search for the maximum covering location problem ⋮ Continuous maximal covering location problems with interconnected facilities ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems

Uses Software

• TSPLIB
• CPLEX
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• 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
• Location science research: a review
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Column generation approach for the point-feature cartographic label placement problem
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
• The Hierarchical Service Location Problem
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
• The Location of Emergency Service Facilities
• The traveling-salesman problem and minimum spanning trees: Part II
• Hierarchical location-allocation models for congested systems