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

Info icon This 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
Image of page 1

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

View Full Document Right 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
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.
Image of page 3

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

View Full Document Right 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 .
Image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern