Lecture18

Lecture18 - IE 495 Lecture 18 October 31, 2000 Happy...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: IE 495 Lecture 18 October 31, 2000 Happy Halloween! Reading for This Lecture Primary Horowitz and Sahni, Chapter 8 Grama and Kumar, Parallel Search Algorithms... Search Algorithms Branch and Bound Methods Branch and Bound is a general method that can be used to solve many NP-complete problems. Components of Branch and Bound Algorithms Definition of the state space. Branching operation. Feasibility checking operation. Bounding operation. Search order. The Traveling Salesman Problem State Space Feasibility Checking Branching Upper Bounding Lower Bounding Search Strategies Depth First Breadth First Highest Lower Bound Lowest Lower Bound Best First More on Search Strategies Goal of Branch and Bound Find the optimal solution as quickly as possible Hence, try to minimize the size of the tree Minimizing the size of the tree Need to find good upper bounds (feasible solutions)....
View Full Document

Page1 / 10

Lecture18 - IE 495 Lecture 18 October 31, 2000 Happy...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online