A Precise Solution to Combinatorial Optimization
Yuejin Tan · Computer Engineering and Science · 2004
A hybrid algorithm combined with dynamic programming and the lower bound (or upper bound) algorithm is proposed. It is on the basis of analysing the depth first search (DFS) and the breadth first search (BFS) methods. Experiments show that this hybrid algorithm is valid when lower bound or upper bound is very close to the optimum of the problem.