A decomposition heuristic for the maximal covering location problem

DOI10.1155/2010/120756MaRDI QIDQ606191zbMATH OpenOpenAlexDBLPWikidataFDO

Authors E. L. F. Senne, Marcos A. Pereira, Luiz Antonio Nogueira Lorena

Publication date 16 November 2010

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• A Lagrangean heuristic for the maximal covering location problem
• Solving the maximal covering location problem with heuristic concentration
• A decomposition approach for the probabilistic maximal covering location-allocation problem
• Fast heuristics for large scale covering-location problems
• The generalized maximal covering location problem
• A practical heuristic for maximum coverage in large-scale continuous location problem
• The Maximal Expected Covering Location Problem: Revisited
• Iterated greedy algorithms for the maximal covering location problem
• Dual-based heuristics for a hierarchical covering location problem
• A note on solutions to the maximal expected covering location problem

Cites work

• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• A Lagrangean heuristic for the maximal covering location problem
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Column generation approach for the point-feature cartographic label placement problem
• Hierarchical location-allocation models for congested systems
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• Location science research: a review
• Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
• The Hierarchical Service Location Problem
• The Location of Emergency Service Facilities
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(9)

• A practical heuristic for maximum coverage in large-scale continuous location problem
• scientific article; zbMATH DE number 4172777 (Why is no real title available?)
• An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
• Continuous maximal covering location problems with interconnected facilities
• Intelligent-guided adaptive search for the maximum covering location problem
• Iterated greedy algorithms for the maximal covering location problem
• A decomposition approach for the probabilistic maximal covering location-allocation problem
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• A constructive proof of swap local search worst-case instances for the maximum coverage problem

Describes a project that uses

Uses Software

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

This page was built for publication: A decomposition heuristic for the maximal covering location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606191)