A trust branching path heuristic for zero-one programming.
Dominique FortinIder TseveendorjPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- optimal solution
- trust model
- search algorithm
- variable ordering
- branch and bound
- programming language
- simulated annealing
- trust evaluation
- greedy heuristic
- computer programming
- object oriented programming
- feasible solution
- shortest path
- access control
- search tree
- endpoints
- combinatorial optimization
- heuristic methods
- development environment
- optimal path
- optimization problems
- dynamic programming
- multi agent