On a Class of Interval Data Minmax Regret CO Problems.
Alfredo Candia-VéjarEduardo Álvarez-MirandaPublished in: OR (2007)
Keyphrases
- interval data
- minmax regret
- shortest path problem
- resource allocation problems
- optimization criterion
- combinatorial optimization problems
- data clustering
- shortest path
- temporal data
- single machine scheduling problem
- branch and bound algorithm
- lower bound
- exact algorithms
- multivariate data
- ant colony optimization
- optimization problems
- upper bound