On the recoverable robust traveling salesman problem

DOI10.1007/S11590-015-0949-5zbMATH Open1355.90078OpenAlexW1727529013MaRDI QIDQ331985FDOQ331985

Marc Goerigk, André 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

Recommendations

• Recoverable robust shortest path problems
• Recoverable Robust Combinatorial Optimization Problems
• A biobjective approach to recoverable robustness based on location planning
• Recoverable robustness by column generation
• Recoverable robust knapsacks: \(\Gamma \)-scenarios

zbMATH Keywords

robust optimizationtraveling salesman problemrecoverable robustness

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47)

Cites Work

• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Theory and Applications of Robust Optimization
• Title not available (Why is that?)
• The Price of Robustness
• Robust discrete optimization and its applications
• Title not available (Why is that?)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Adjustable robust solutions of uncertain linear programs
• A note on upper bounds to the robust knapsack problem with discrete scenarios
• Recoverable Robust Timetable Information
• The concept of recoverable robustness, linear programming recovery, and railway applications
• 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
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• The Exact Subgraph Recoverable Robust Shortest Path Problem

Cited In (17)

• Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
• Robustness in nonsmooth nonconvex optimization problems
• Recoverable robust shortest path problems
• Benchmarking problems for robust discrete optimization
• On recoverable and two-stage robust selection problems with budgeted uncertainty
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Robust recoverable and two-stage selection problems
• Exact lexicographic scheduling and approximate rescheduling
• Recoverable robust spanning tree problem under interval uncertainty representations
• Robust Algorithms for TSP and Steiner Tree
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
• Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
• On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
• Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
• Recoverable Robust Combinatorial Optimization Problems
• Recoverable robust shortest path problem under interval budgeted uncertainty representations
• Robust recoverable 0-1 optimization problems under polyhedral uncertainty

Uses Software

• LKH

This page was built for publication: On the recoverable robust traveling salesman problem

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