A VNS-LP algorithm for the robust dynamic maximal covering location problem

DOI10.1007/S00291-017-0482-2MaRDI QIDQ1642060zbMATH OpenOpenAlexFDO

Authors Stefan Mišković

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

zbMATH Keywords

linear programmingrobust optimizationvariable neighborhood searchdynamic maximal covering location problem

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• A hybrid method for the probabilistic maximal covering location-allocation problem
• An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network
• The large-scale dynamic maximal covering location problem
• Formulation and algorithms for the robust maximal covering location problem
• An exact algorithm for the maximal covering problem

Cites work

• A Lagrangean heuristic for the maximal covering location problem
• A multiperiod set covering location model for dynamic redeployment of ambulances
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• Design and analysis of experiments.
• Determining optimal police patrol areas with maximal covering and backup covering location models
• Matheuristics
• Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Robust Solutions to Uncertain Semidefinite Programs
• Robust convex optimization
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust solutions of uncertain linear programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Maximum Availability Location Problem
• The Price of Robustness
• The generalized maximal covering location problem
• The large-scale dynamic maximal covering location problem
• The multimode covering location problem
• Variable neighborhood search

Cited in

(7)

• The large-scale dynamic maximal covering location problem
• Formulation and algorithms for the robust maximal covering location problem
• An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network
• A separation based optimization approach to dynamic maximal covering location problems with switched structure
• Robust min-max regret covering problems
• Minimum common string partition: on solving large‐scale problem instances
• A hybrid method for the probabilistic maximal covering location-allocation problem

Describes a project that uses

Uses Software

• CPLEX
• SITATION
• MOD-DIST
• MENU-OKF

This page was built for publication: A VNS-LP algorithm for the robust dynamic maximal covering location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642060)