Dissertation Defense :: Measuring Facets of Polyhedra to Predict Usefulness in Branch-and-cut Algorithms

Event Details
  • Date/Time:
    • Tuesday August 12, 2003
      10:00 am - 12:00 am
  • Location: ISyE/Groseclose - Room 403
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102
Summaries

Summary Sentence: Dissertation Defense :: Measuring Facets of Polyhedra to Predict Usefulness in Branch-and-cut Algorithms

Full Summary: Dissertation Defense :: Measuring Facets of Polyhedra to Predict Usefulness in Branch-and-cut Algorithms

Integer programming (IP) can be used to model a variety of industrial problems. One of the most successful ways of solving IPs has been the use of branch-and-cut algorithms, which combine a branch-and-bound framework with the use of cutting planes. This dissertation considers measures of cutting planes with the aim of predicting and understanding their usefulness in branch-and-cut. Measures considered include the volume of the facet, the shooting experiment size of the facet, the best-case improvement that the facet provides, and the Chv'atal-Gomory rank of the facet.

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:42am
  • Last Updated: Oct 7, 2016 - 9:52pm