An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem.
Amadeu Almeida CocoJoão Carlos Abreu JúniorThiago F. NoronhaAndréa Cynthia SantosPublished in: J. Glob. Optim. (2014)
Keyphrases
- shortest path problem
- shortest path
- single source
- interval data
- heuristic solution
- directed graph
- search algorithm
- lower bound
- weighted least squares
- worst case
- online learning
- neural network
- directed acyclic graph
- search strategies
- integer linear programming formulation
- robust optimization
- weighted average
- multiple objectives
- loss function
- upper bound
- evolutionary algorithm
- bayesian networks