Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios

DOI10.1016/j.disopt.2015.11.001zbMath1387.90266OpenAlexW2196377485MaRDI QIDQ1751178

Marisa Resende, Marta M. B. Pascoal

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.11.001

zbMATH Keywords

robust shortest pathdiscrete scenariosdynamic preprocessing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items (1)

Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Reduction approaches for robust shortest path problems
• On the robust shortest path problem.
• The robust shortest path problem with interval data via Benders decomposition
• Solving min-max shortest-path problems on a network
• Fast Evaluation of Union-Intersection Expressions

This page was built for publication: Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios