A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillsman's edition

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 9, Issue 1, 2002, Pages 57-67

  Lorena, Luiz A N ^a   Pereira, Marcos A ^a  

^a INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Geographic information systems; Heuristic solution; Hillsman's edition; Lagrangean and surrogate relaxation; Maximal covering location problems; p median problems

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER AIDED DESIGN; GEOGRAPHIC INFORMATION SYSTEMS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEAR SYSTEMS; MAXIMUM PRINCIPLE; PROBLEM SOLVING; RANDOM PROCESSES;

HILLSMAN EDITION; LAGRANGEAN HEURISTIC; MAXIMAL COVERING LOCATION PROBLEM; P-MEDIAN PROBLEMS; SURROGATE HEURISTIC; UNIFIED LINEAR MODEL;

INDUSTRIAL ENGINEERING;

EID: 0036504823     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. OR-Library: Distributing test problems by electronic mail
2. The maximal covering location problem
3. Calculating surrogate constraints
4. A lagrangean heuristic for the maximal covering location problem
5. A comparison of lagrangean and surrogate relaxations for the maximal covering location problem
6. Surrogate constraints
7. Optimum distribution of switching centers in a communication network and some related graph theoretic problems
8. A dual algorithm for the constrained shortest path problem
9. The p-Median structure as a unified linear model for location-allocation analysis
10. The traveling salesman problem and minimum spanning trees: Part II
11. Some relationships between lagrangean and surrogate duality in integer programming
12. Plus courts chemins avec constraints: Algorithmes et applications
13. Lagrangean/Surrogate relaxation for generalized assignment problems
14. Central facilities location
15. Network distance characteristics that affect computational effort in p-Median location problems
16. Lagrangean/Surrogate heuristics for p-Median problems. In computing tools for modeling, Optimization and simulation