A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem.
André B. ChasseinMarc GoerigkPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- interval data
- shortest path problem
- minmax regret
- multiple objectives
- shortest path
- combinatorial optimization problems
- single source
- optimization problems
- optimization method
- directed graph
- lower bound
- combinatorial optimization
- bayesian networks
- temporal data
- optimization algorithm
- exact solution
- upper bound
- integer programming
- directed acyclic graph
- metaheuristic
- multi objective
- objective function