Robust optimization for routing problems on trees

DOI10.1007/S11750-015-0384-XMaRDI QIDQ301384zbMATH OpenOpenAlexFDO

Authors Sabine Büttner, Sven O. Krumke

Publication date 30 June 2016

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11750-015-0384-x

zbMATH Keywords

uncertaintydynamic programmingrobust optimizationprize collecting traveling salesman problemrouting problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Exact approaches for solving robust prize-collecting Steiner tree problems
• Efficient algorithms for the prize collecting Steiner tree problems with interval data
• Improved approximation algorithms for prize-collecting Steiner tree and TSP
• Risk models for the prize collecting Steiner tree problems with interval data
• The prize collecting traveling salesman problem

Cites work

• scientific article; zbMATH DE number 432827 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1263203 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A note on the \(k\)-Canadian traveller problem
• A note on the prize collecting traveling salesman problem
• A scenario-based approach for robust linear optimization
• Adjustable robust solutions of uncertain linear programs
• An empirical analysis of robustness concepts for timetabling
• Generalized light robustness and the trade-off between robustness and nominal quality
• Improved approximation algorithms for prize-collecting Steiner tree and TSP
• Light robustness
• On the robust shortest path problem.
• Recent advances in robust optimization: an overview
• Robust convex optimization
• Robust optimization
• Robust optimization - a comprehensive survey
• Robust solutions of linear programming problems contaminated with uncertain data
• The Price of Robustness
• The concept of recoverable robustness, linear programming recovery, and railway applications
• The prize collecting traveling salesman problem
• The traveling salesman. Computational solutions for RSP applications
• Theory and applications of robust optimization

Cited in

(6)

• Robust Algorithms for TSP and Steiner Tree
• Rotor-routing on Galton-Watson trees
• On the complexity of an optimal routing tree problem
• Robust multiobjective optimization with application to Internet routing
• Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
• Exact approaches for solving robust prize-collecting Steiner tree problems

Describes a project that uses

Uses Software

• TSPLIB
• ROPI

This page was built for publication: Robust optimization for routing problems on trees

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