On the recoverable robust traveling salesman problem
From MaRDI portal
Publication:331985
DOI10.1007/s11590-015-0949-5zbMath1355.90078OpenAlexW1727529013MaRDI QIDQ331985
Marc Goerigk, André B. Chassein
Publication date: 27 October 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/76533/1/paper_bw.pdf
Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The recoverable robust spanning tree problem with interval costs is polynomially solvable, Robustness in nonsmooth nonconvex optimization problems, On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty, Recoverable robust spanning tree problem under interval uncertainty representations, Robust recoverable and two-stage selection problems, On recoverable and two-stage robust selection problems with budgeted uncertainty, Robust Algorithms for TSP and Steiner Tree, Robust recoverable 0-1 optimization problems under polyhedral uncertainty, On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential, Exact lexicographic scheduling and approximate rescheduling, Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios, Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and its applications
- Adjustable robust solutions of uncertain linear programs
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Recoverable robust shortest path problems
- Recoverable Robustness by Column Generation
- Theory and Applications of Robust Optimization
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- The Exact Subgraph Recoverable Robust Shortest Path Problem
- Recoverable Robust Timetable Information
