The minmax regret robust shortest path problem in a finite multi-scenario model
From MaRDI portal
Publication:279255
DOI10.1016/J.AMC.2014.04.076zbMATH Open1334.90191OpenAlexW2093308381MaRDI QIDQ279255FDOQ279255
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding the k Shortest Paths
- Fibonacci heaps and their uses in improved network optimization algorithms
- Recent advances in robust optimization: an overview
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- A bicriterion shortest path algorithm
- 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
- 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
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Finding the K Shortest Loopless Paths in a Network
- The robust spanning tree problem with interval data
- Reduction approaches for robust shortest path problems
Cited In (7)
- 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
- A minmax regret version of the time-dependent shortest path problem
- Shortest path network problems with stochastic arc weights
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- 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
This page was built for publication: The minmax regret robust shortest path problem in a finite multi-scenario model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q279255)
