COMBINATORIAL OPTIMIZATION

Math 552/Comp 552 - Fall Term, 2007.

General Information.

  • Course Instructor
  • Teaching Assistant
  • Lectures
  • Overview
  • Prerequisites
  • Textbooks
  • Assignments

    Instructor.

  • Prof. Adrian Vetta
  • Telephone: 398-3822
  • Office: Room 1118, Burnside Building
  • Office hours: Tuesday, 3pm to 4.30pm.
  • Email: vetta at math dot mcgill dot ca
    • Top

    Teaching Assistant.

  • Nicolas Sonnerat
  • Office: Room 1140, Burnside Building
  • Office hours: Thursday, 3pm to 4.30pm.
  • Email: sonnerat at math dot mcgill dot ca
    Top

    Lectures.

  • Time: Monday and Wednesday, 1pm - 2.30pm.
  • Location: Room 103, McConnell Engineering Building
    Top

    Overview.

    We will give a thorough introduction to the field of combinatorial optimization. In particular,
    our focus will be on polyhedral and algorithmic methods and their applications.
    Top

    Topics.

    A provisional list of the lectures can be found here.
    Top

    Pre-requisites.

    The prerequisites are Math 350 or Comp 362 or equivalent. This course is primarily aimed at higher
    level undergraduate and graduate students in mathematics or computer science. No formal experience
    with these topics will be needed, but a strong mathematical background is necessary.
    Top

    Textbooks.

    The course texts are Combinatorial Optimization: Polyhedra and Efficiency by A. Schrijver
    or Combinatorial Optimization by W. Cook, W. Cunningham, W. Pulleyblank and A. Schrijver.
    Top

    Assignments.

    Course grades will be based upon assignments (25%) and a final exam (75%).
    Assignments are posted here.
    Top