Dual-based heuristics for a hierarchical covering location problem

DOI10.1016/S0305-0548(01)00087-9zbMath1029.90034MaRDI QIDQ1869894

Luis Gonzalo Acosta Espejo, Brian Boffey, Roberto Diéguez Galvão

Publication date: 28 April 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Heuristicsrelaxationscovering modelsHierarchical location

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

A review of hierarchical facility location models, Multi-type maximal covering location problems: hybridizing discrete and continuous problems, On the overlap area of a disk and a piecewise circular domain, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchical location-allocation problems: A classification scheme
• Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
• The maximum-capture hierarchical location problem
• A Lagrangean heuristic for the maximal covering location problem
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Johri's general dual, the Lagrangian dual, and the surrogate dual
• The Nested Hierarchical Median Facility Location Model
• Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
• Some relationships between lagrangian and surrogate duality in integer programming
• The Hierarchical Service Location Problem
• Surrogate Mathematical Programming