Solving the traveling salesman problem with interdiction and fortification

DOI10.1016/j.orl.2017.02.007zbMath1409.90111OpenAlexW2593695759MaRDI QIDQ1728213

Leonardo Lozano, J. Cole Smith, Mary E. Kurz

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.02.007

zbMATH Keywords

integer programmingtraveling salesman probleminterdiction

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (5)

A generic optimization framework for resilient systems ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics

Uses Software

• TSPLIB
• LKH
• Concorde

Cites Work

• Unnamed Item
• Optimizing dynamic investment decisions for railway systems protection
• Designing robust coverage networks to hedge against worst-case facility losses
• A survey of very large-scale neighborhood search techniques
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A review of dynamic vehicle routing problems
• Survivable network design under optimal and heuristic interdiction scenarios
• A bilevel mixed-integer program for critical infrastructure protection planning
• An exact solution approach for the interdiction median problem with fortification
• TSPLIB—A Traveling Salesman Problem Library
• A three‐stage procurement optimization problem under uncertainty
• Shortest-path network interdiction
• The Traveling-Salesman Problem
• Canonical Cuts on the Unit Hypercube
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• A Backward Sampling Framework for Interdiction Problems with Fortification

This page was built for publication: Solving the traveling salesman problem with interdiction and fortification