Variable neighborhood search method for optimizing the emergency service network of police special forces units
DOI10.1016/J.ENDM.2012.10.025zbMATH Open1268.90146OpenAlexW2094440461MaRDI QIDQ2840772FDOQ2840772
Authors: Igor Grujičić, Zorica Stanimirović
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.025
Recommendations
- An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network
- Variable neighborhood search: Principles and applications
- A variable neighbourhood search method for solving the long-term care facility location problem
- Variable Neighborhood Search
- A new model and tabu search approach for planning the emergency service stations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
Cited In (3)
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
- Variable neighborhood search for the pharmacy duty scheduling problem
- An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network
Uses Software
This page was built for publication: Variable neighborhood search method for optimizing the emergency service network of police special forces units
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840772)