The robust shortest path problem in series-parallel multidigraphs with interval data.
Adam KasperskiPawel ZielinskiPublished in: Oper. Res. Lett. (2006)
Keyphrases
- interval data
- shortest path problem
- series parallel
- minmax regret
- shortest path
- combinatorial optimization problems
- multiple objectives
- directed graph
- temporal data
- lower bound
- data clustering
- directed acyclic graph
- multivariate data
- evolutionary algorithm
- temporal reasoning
- precedence constraints
- temporal information
- high dimensional