Iterative Deepening Branch and Bound

Details Iterative Deepening Branch and Bound Iterative Deepening Branch and Bound

1999-09-03

arxiv.org/abs/cs/9909003v1

Computer Science

Artificial Intelligence

39 html pages + 4 gif files (fig1,fig1(a),fig2,fig3)

Scientific paper

In tree search problem the best-first search algorithm needs too much of space . To remove such drawbacks of these algorithms the IDA* was developed which is both space and time cost efficient. But again IDA* can give an optimal solution for real valued problems like Flow shop scheduling, Travelling Salesman and 0/1 Knapsack due to their real valued cost estimates. Thus further modifications are done on it and the Iterative Deepening Branch and Bound Search Algorithms is developed which meets the requirements. We have tried using this algorithm for the Flow Shop Scheduling Problem and have found that it is quite effective.

Affiliated with

Also associated with

No associations

Rating

Iterative Deepening Branch and Bound does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iterative Deepening Branch and Bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative Deepening Branch and Bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-543090