This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Integer Programming IE418 Lecture 15 Dr. Ted Ralphs IE418 Lecture 15 1 Reading for This Lecture • Linderoth and Savelsbergh (1991) • Savelsbergh (1994) • Martin (2001) IE418 Lecture 15 2 Putting it All Together: Search Strategies • In the last lecture, we discussed how to branch , i.e., divide the feasible region of a subproblem into two pieces. • After branching, we still have to face the question of what node to process next. • The strategy for deciding what node to work on next is called the search strategy . • In choosing a search strategy, we might consider our goal: – Minimize the time required to find a provably optimal solution. – Find the best possible solution in a limited amount of time. • In practice, we may want some of each. IE418 Lecture 15 3 Basic Strategies: Best First • A reasonable approach to minimizing overall solution time is to try to minimize the size of the search tree....
View
Full
Document
This note was uploaded on 08/06/2008 for the course IE 418 taught by Professor Ralphs during the Spring '08 term at Lehigh University .
 Spring '08
 Ralphs

Click to edit the document details