A Branch-and-Bound-with-Underestimates Algorithm for the Task Assignment Problem with Precedence Constraint.
Gen-Huey ChenJyh-Shiarn YurPublished in: ICDCS (1990)
Keyphrases
- branch and bound
- optimal solution
- search space
- cost function
- np hard
- computational complexity
- dynamic programming
- combinatorial optimization
- objective function
- tree search algorithm
- branch and bound procedure
- upper bound
- simulated annealing
- branch and bound algorithm
- probabilistic model
- lower bound
- monte carlo
- linear program
- column generation
- tree search
- beam search
- depth first search
- network design problem
- integer programming problems