The minmax regret robust shortest path problem in a finite multi-scenario model
From MaRDI portal
Publication:279255
DOI10.1016/j.amc.2014.04.076zbMath1334.90191OpenAlexW2093308381MaRDI QIDQ279255
Marta M. B. Pascoal, Marisa Resende
Publication date: 27 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/44387
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (5)
Algorithms for the minmax regret path problem with interval data ⋮ Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions ⋮ Shortest path network problems with stochastic arc weights ⋮ Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
Uses Software
Cites Work
- Reduction approaches for robust shortest path problems
- A bicriterion shortest path algorithm
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A new implementation of Yen's ranking loopless paths algorithm
- An exact algorithm for the robust shortest path problem with interval data
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Recent advances in robust optimization: an overview
- The robust shortest path problem with interval data via Benders decomposition
- An enhanced exact procedure for the absolute robust shortest path problem
- Solving min-max shortest-path problems on a network
- Finding the k Shortest Paths
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective
- Fibonacci heaps and their uses in improved network optimization algorithms
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Finding the K Shortest Loopless Paths in a Network
- The robust spanning tree problem with interval data
- Unnamed Item
- Unnamed Item
This page was built for publication: The minmax regret robust shortest path problem in a finite multi-scenario model