2-edge-connected Polyhedra, Relationship with the Graphical TSP & Lifted Inequalities for 0-1 Mixed Integer Programming

Event Details
  • Date/Time:
    • Thursday November 1, 2001 - Wednesday October 31, 2001
      10:00 am - 11:00 pm
  • Location: Instructional Center Room 207
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102
Summaries

Summary Sentence: 2-edge-connected Polyhedra, Relationship with the Graphical TSP & Lifted Inequalities for 0-1 Mixed Integer Programming

Full Summary: 2-edge-connected Polyhedra, Relationship with the Graphical TSP & Lifted Inequalities for 0-1 Mixed Integer Programming

Presentation 1:
2-edge-connected Polyhedra, Relationship with the Graphical TSP
by Dieter Vandenbussche

Presentation 2:
Lifted Inequalities for 0-1 Mixed Integer Programming
by Jean-Philippe Richard

Both these talks will be given at the INFORMS meeting in Miami as well.

Additional Information

In Campus Calendar
No
Groups

H. Milton Stewart School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Barbara Christopher
  • Workflow Status: Published
  • Created On: Oct 8, 2010 - 7:43am
  • Last Updated: Oct 7, 2016 - 9:53pm