An enhanced exact procedure for the absolute robust shortest path problem

DOI10.1111/J.1475-3995.2009.00702.XMaRDI QIDQ3563623zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maria Elena Bruni, Francesca Guerriero

Publication date 31 May 2010

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2009.00702.x

zbMATH Keywords

heuristic searchrobust optimizationscenarios

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An exact algorithm for the robust shortest path problem with interval data
• On the robust shortest path problem.
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
• Robust shortest path problems

Cites work

• A branch and bound algorithm for the robust shortest path problem with interval data.
• An exact algorithm for the robust shortest path problem with interval data
• Inequalities: theory of majorization and its applications
• Interval data minmax regret network optimization problems
• Minmax regret solutions for minimax optimization problems with uncertainty
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• On the robust shortest path problem.
• Robust discrete optimization and its applications
• The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
• The robust shortest path problem with interval data via Benders decomposition

Cited in

(8)

• An exact algorithm for the robust shortest path problem with interval data
• Shortest path network problems with stochastic arc weights
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Recoverable robust shortest path problems
• Robust shortest path planning and semicontractive dynamic programming
• The Exact Subgraph Recoverable Robust Shortest Path Problem
• The computational complexity of the relative robust shortest path problem with interval data
• Robust and distributionally robust shortest path problems: a survey

This page was built for publication: An enhanced exact procedure for the absolute robust shortest path problem

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