Solving the traveling salesman problem with interdiction and fortification
Authors:
- Leonardo LozanoLLLeonardo Lozano
- J. Cole SmithJSJ. Cole Smith
- Mary E. KurzMKMary E. Kurz
- 1 May 2017
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 45 (3) , 210-216
Abstract
No abstract availableKeywords
Funding Information
- Air Force Office of Scientific Research (FA9550-12-1-0353)
- Office of Naval Research (N000141310036)
This publication has 20 references indexed in Scilit:
- A review of dynamic vehicle routing problemsEuropean Journal of Operational Research, 2013
- Designing robust coverage networks to hedge against worst-case facility lossesEuropean Journal of Operational Research, 2011
- An exact solution approach for the interdiction median problem with fortificationEuropean Journal of Operational Research, 2008
- A bilevel mixed-integer program for critical infrastructure protection planningComputers & Operations Research, 2008
- Protecting Critical Assets: The r‐Interdiction Median Problem with FortificationGeographical Analysis, 2007
- A survey of very large-scale neighborhood search techniquesDiscrete Applied Mathematics, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Shortest‐path network interdictionNetworks, 2002
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972