Login / Signup
Improved polynomial algorithms for robust bottleneck problems with interval data.
A. Volgenant
C. W. Duin
Published in:
Comput. Oper. Res. (2010)
Keyphrases
</>
interval data
optimization problems
combinatorial optimization
benchmark problems
combinatorial optimization problems
learning algorithm
data clustering
hybrid algorithm
minmax regret
cost function
shortest path problem