A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
From MaRDI portal
Publication:1577777
DOI10.1016/S0377-2217(99)00171-XzbMath0967.90068OpenAlexW2025877467MaRDI QIDQ1577777
Brian Boffey, Luis Gonzalo Acosta Espejo, Roberto Diéguez Galvão
Publication date: 3 September 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00171-x
Related Items (16)
A maximal covering location model in the presence of partial coverage ⋮ Determining optimal police patrol areas with maximal covering and backup covering location models ⋮ Multi satellites scheduling algorithm based on task merging mechanism ⋮ Intelligent-guided adaptive search for the maximum covering location problem ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ A decomposition heuristic for the maximal covering location problem ⋮ An agent-based framework for modeling and solving location problems ⋮ Matheuristics: survey and synthesis ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ Bayesian coverage optimization models ⋮ A dual bounding scheme for a territory design problem ⋮ A branch and bound algorithm for determining locations of long-term care facilities ⋮ A separation based optimization approach to dynamic maximal covering location problems with switched structure ⋮ Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ Dual-based heuristics for a hierarchical covering location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for the linear multiple-choice knapsack problem
- Exact methods for the knapsack problem and its generalizations
- A Lagrangean heuristic for the maximal covering location problem
- An adaptation of SH heuristic to the location set covering problem
- Relaxation heuristics for a generalized assignment problem
- A surrogate heuristic for set covering problems
- An algorithm for set covering problem
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- Some relationships between lagrangian and surrogate duality in integer programming
- Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem
- Surrogate Constraint Duality in Mathematical Programming
- Bicriterion Programs and Managerial Location Decisions: Application to the Banking Sector
- An exact algorithm for the maximal covering problem
- Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- Surrogate Mathematical Programming
This page was built for publication: A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
