Recoverable robust spanning tree problem under interval uncertainty representations.

Mikita Hradovich Adam Kasperski Pawel Zielinski

Published in: CoRR (2016)

Keyphrases

interval data
higher level
computationally efficient
real time
data mining
incomplete information
symbolic representation
inherent uncertainty
minmax regret
neural network
decision trees
special case
rough sets
sufficient conditions
partial occlusion
robust optimization