A VNS-LP algorithm for the robust dynamic maximal covering location problem
From MaRDI portal
Publication:1642060
DOI10.1007/S00291-017-0482-2zbMath1396.90042OpenAlexW2618599606MaRDI QIDQ1642060
Publication date: 20 June 2018
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-017-0482-2
linear programmingrobust optimizationvariable neighborhood searchdynamic maximal covering location problem
Related Items (2)
Robust min-max regret covering problems ⋮ Minimum common string partition: on solving large‐scale problem instances
Uses Software
Cites Work
- Unnamed Item
- The multimode covering location problem
- A Lagrangean heuristic for the maximal covering location problem
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Variable neighborhood search
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- The large-scale dynamic maximal covering location problem
- Determining optimal police patrol areas with maximal covering and backup covering location models
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Robust Convex Optimization
- The Price of Robustness
- Matheuristics
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- The Maximum Availability Location Problem
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The generalized maximal covering location problem
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
This page was built for publication: A VNS-LP algorithm for the robust dynamic maximal covering location problem
