Dual-based heuristics for a hierarchical covering location problem

DOI10.1016/S0305-0548(01)00087-9zbMATH Open1029.90034MaRDI QIDQ1869894FDOQ1869894

Authors: 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)

Recommendations

• A Lagrangean heuristic for the maximal covering location problem
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• scientific article; zbMATH DE number 4121754
• Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
• Lower and upper bounds for a two-level hierarchical location problem in computer networks

zbMATH Keywords

relaxationsHeuristicscovering modelsHierarchical location

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• On the overlap area of a disk and a piecewise circular domain
• A decomposition heuristic for the maximal covering location problem
• Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
• A review of hierarchical facility location models
• Lagrangean relaxation-based techniques for solving facility location problems
• Multi-type maximal covering location problems: hybridizing discrete and continuous problems

Uses Software

• CPLEX

This page was built for publication: Dual-based heuristics for a hierarchical covering location problem

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