A Lagrangean heuristic for the maximal covering location problem
From MaRDI portal
Publication:1266569
DOI10.1016/0377-2217(94)00159-6zbMath0913.90200OpenAlexW2004389393MaRDI QIDQ1266569
Roberto Diéguez Galvão, Charles S. Re Velle
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00159-6
Lagrangean relaxationlower boundsheuristicsubgradient optimizationmaximal covering location problemLagrangean heuristic
Related Items (36)
A maximal covering location model in the presence of partial coverage ⋮ Towards unified formulations and extensions of two classical probabilistic location models ⋮ Determining optimal police patrol areas with maximal covering and backup covering location models ⋮ A VNS-LP algorithm for the robust dynamic maximal covering location problem ⋮ Solving the maximal covering location problem with heuristic concentration ⋮ A hybrid method for the probabilistic maximal covering location-allocation problem ⋮ Local search heuristics for the mobile facility location problem ⋮ Intelligent-guided adaptive search for the maximum covering location problem ⋮ A decomposition heuristic for the maximal covering location problem ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ Covering models and optimization techniques for emergency response facility location and planning: a review ⋮ Déploiement et Redéploiement des Véhicules Ambulanciers dans la Gestion d'un Service Préhospitalier d'Urgence ⋮ Optimizing emergency services for road safety using a decomposition method: a case study of Delhi ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ On the overlap area of a disk and a piecewise circular domain ⋮ A multiple server location-allocation model for service system design ⋮ Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles ⋮ The heuristic concentration-integer and its application to a class of location problems ⋮ A dual bounding scheme for a territory design problem ⋮ Load balancing and capacity constraints in a hierarchical location model ⋮ Facility location models for distribution system design ⋮ Practical aspects associated with location planning for maternal and perinatal assistance in Brazil ⋮ A decomposition approach for the probabilistic maximal covering location-allocation problem ⋮ Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems ⋮ Large-scale local search heuristics for the capacitated vertexp-center problem ⋮ A new model for maximal coverage exploiting GIS capabilities ⋮ Resource-constrained management of heterogeneous assets with stochastic deterioration ⋮ A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem ⋮ Covering Problems ⋮ A multi-objective model for locating fire stations ⋮ A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro ⋮ Dual-based heuristics for a hierarchical covering location problem
Cites Work
- The capacitated maximal covering location problem with backup service
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Computer Solutions of the Traveling Salesman Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Algorithms for Large-scale Travelling Salesman Problems
This page was built for publication: A Lagrangean heuristic for the maximal covering location problem
