Robust optimization for routing problems on trees

DOI10.1007/s11750-015-0384-xzbMath1342.90211OpenAlexW646779052MaRDI QIDQ301384

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 optimizationrouting problemprize collecting traveling salesman problem

Mathematics Subject Classification ID

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

Related Items (1)

Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios

Uses Software

• TSPLIB
• ROPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized light robustness and the trade-off between robustness and nominal quality
• A note on the prize collecting traveling salesman problem
• A note on the \(k\)-Canadian traveller problem
• Robust optimization - a comprehensive survey
• The traveling salesman. Computational solutions for RSP applications
• On the robust shortest path problem.
• Adjustable robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• Recent advances in robust optimization: an overview
• Robust Convex Optimization
• An Empirical Analysis of Robustness Concepts for Timetabling
• A Scenario-Based Approach for Robust Linear Optimization
• Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
• Theory and Applications of Robust Optimization
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Light Robustness
• The prize collecting traveling salesman problem

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