Complexity of minimizing the total flow time with interval data and minmax regret criterion.
Vasilij LebedevIgor AverbakhPublished in: Discret. Appl. Math. (2006)
Keyphrases
- minmax regret
- interval data
- optimization criterion
- shortest path problem
- temporal data
- data clustering
- cost function
- combinatorial optimization problems
- single machine scheduling problem
- optimization problems
- spatial data
- cluster analysis
- feature selection
- fitness function
- shortest path
- simulated annealing
- principal component analysis
- upper bound
- objective function