On the recoverable robust traveling salesman problem

DOI10.1007/S11590-015-0949-5MaRDI QIDQ331985zbMATH OpenOpenAlexFDO

Authors André Chassein, Marc Goerigk

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

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)

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

Cites work

• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A Benders decomposition approach for the robust spanning tree problem with interval data
• A note on upper bounds to the robust knapsack problem with discrete scenarios
• Adjustable robust solutions of uncertain linear programs
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Recoverable robust shortest path problems
• Recoverable robust timetable information
• Recoverable robustness by column generation
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Robust discrete optimization and its applications
• Robust optimization
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• The Exact Subgraph Recoverable Robust Shortest Path Problem
• The Price of Robustness
• The concept of recoverable robustness, linear programming recovery, and railway applications
• Theory and applications of robust optimization

Cited in

(18)

• 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
• Modifying Soyster's model for the symmetric traveling salesman problem with interval travel times
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
• Robust Algorithms for TSP and Steiner Tree
• 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

Describes a project that uses

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)