Login / Signup
A polynomial solvable minimum risk spanning tree problem with interval data.
Xujin Chen
Jie Hu
Xiaodong Hu
Published in:
Eur. J. Oper. Res. (2009)
Keyphrases
</>
interval data
minimum risk
minmax regret
shortest path problem
special case
data clustering
np hard
temporal data
multivariate data
computational complexity
shortest path
choquet integral
optimization criterion
genetic algorithm
data sets
data analysis
bayesian networks
feature selection
data mining