A Branch and Bound algorithm for the minimax regret spanning arborescence.
Eduardo CondePublished in: J. Glob. Optim. (2007)
Keyphrases
- branch and bound algorithm
- minimax regret
- lower bound
- branch and bound
- preference elicitation
- upper bound
- utility function
- decision problems
- np hard
- combinatorial optimization
- optimal solution
- stochastic programming
- misclassification costs
- optimization criterion
- reward function
- similarity search
- neural network
- objective function
- knn
- feature vectors
- linear program
- search algorithm
- learning algorithm