Lecture9 - Integer Programming IE418 Lecture 9 Dr. Ted...

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

View Full Document Right Arrow Icon
Integer Programming IE418 Lecture 9 Dr. Ted Ralphs
Background image of page 1

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

View Full DocumentRight Arrow Icon
IE418 Lecture 9 1 Reading for This Lecture Wolsey Chapter 3 Nemhauser and Wolsey Sections III.3.1-III.3.3, II.1.1
Background image of page 2
IE418 Lecture 9 2 Combinatorial Algorithms for Integer Programming Some integer programs can be solved using so-called combinatorial algorithms , which do not rely on polyhedral theory. For example, there are various combinatorial algorithms for solving minimum cost network flow problem and special cases. Shortest Path Problem Maximum Flow Problem Matching Problem Another related example is the Minimum Cut Problem . Algorithms for these problems are covered in more detail in a network flows course.
Background image of page 3

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

View Full DocumentRight Arrow Icon
IE418 Lecture 9 3 The Maximum Spanning Tree Problem Consider an undirected graph G = ( N, E ) with cost vector c Z E . The Maximum Spanning Tree Problem is to find a spanning tree of maximum total cost. Such a spanning tree can be found using a greedy algorithm . Greedy Algorithm
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the 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 .

Page1 / 9

Lecture9 - Integer Programming IE418 Lecture 9 Dr. Ted...

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

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