Robust optimization for routing problems on trees

DOI10.1007/S11750-015-0384-XzbMATH Open1342.90211OpenAlexW646779052MaRDI QIDQ301384FDOQ301384

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

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

zbMATH Keywords

uncertaintydynamic programmingrobust optimizationprize collecting traveling salesman problemrouting problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Recent advances in robust optimization: an overview
• Theory and applications of robust optimization
• Robust optimization
• The Price of Robustness
• The prize collecting traveling salesman problem
• On the robust shortest path problem.
• Robust solutions of linear programming problems contaminated with uncertain data
• Light robustness
• Title not available (Why is that?)
• Robust convex optimization
• Generalized light robustness and the trade-off between robustness and nominal quality
• Robust optimization - a comprehensive survey
• A note on the prize collecting traveling salesman problem
• Adjustable robust solutions of uncertain linear programs
• The traveling salesman. Computational solutions for RSP applications
• 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
• Title not available (Why is that?)
• The concept of recoverable robustness, linear programming recovery, and railway applications
• Title not available (Why is that?)
• A note on the \(k\)-Canadian traveller problem

Cited In (6)

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

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)