Dual-based heuristics for a hierarchical covering location problem

Computers and Operations Research

Volumn 30, Issue 2, 2003, Pages 165-180

  Espejo, Luis Gonzalo Acosta ^a   Galvão, Roberto D ^a   Boffey, Brian ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Covering models; Heuristics; Hierarchical location; Relaxations

Indexed keywords

PROBLEM SOLVING; RELAXATION PROCESSES;

TEST PROBLEMS;

HEURISTIC METHODS;

HIERARCHICAL SYSTEM;

EID: 0037290403     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00087-9     Document Type: Article

References (28)

1. A review of covering problems in facility location
2. The maximal covering location problem
3. A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
4. Multiobjective covering and routing problems
5. The hierarchical service location problem
6. A multitype hierarchical distribution system with multi-level distribution centers
7. The maximum-capture hierarchical location problem
8. Hierarchical location-allocation problems: A classification scheme
9. A generalized approach to modeling the hierarchical location-allocation problem
10. Hierarchical location analysis for integrated area planning in rural India
11. Location of health care facilities: An analytic approach
12. An optimization model for a hierarchical spatial system
13. A hierarchical location-allocation problem
14. The logic of health care facility planning
15. Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchical location-allocation problem
16. Minisum hierarchical location-allocation problems in a network: A survey
17. The nested hierarchical median facility location model
18. Surrogate mathematical programming
19. Using surrogate constraint in a Lagrangean relaxation approach to set-covering problems
20. Johri's general dual, the Lagrangian dual, and the surrogate dual
21. Lagrangean relaxation for integer programming
22. Some relationships between Lagrangian and surrogate duality in integer programming
23. A Lagrangean heuristic for the maximal covering location problem
24. On improving relaxation methods by modified gradient techniques
25. Computational improvements for subgradient optimization