An Efficient Algorithm for Determining the Length of the Longest Dead Path in a "LIFO" Branch-and-Bound Exploration Schema.
Stefano PallottinoTommaso ToffoliPublished in: ACM Trans. Math. Softw. (1981)
Keyphrases
- branch and bound
- optimal solution
- search space
- combinatorial optimization
- search algorithm
- branch and bound procedure
- memory efficient
- depth first search
- np hard
- monte carlo
- path planning
- cost function
- lower bound
- computational complexity
- column generation
- objective function
- tree search algorithm
- branch and bound search
- convex hull
- upper bound
- scheduling problem
- probabilistic model
- dynamic programming