event
Dissertation Defense :: Measuring Facets of Polyhedra to Predict Usefulness in Branch-and-cut Algorithms
Primary tabs
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.
Status
-
Workflow Status:
Published -
Created By:
Barbara Christopher -
Created:
10/08/2010 -
Modified By:
Fletcher Moore -
Modified:
10/07/2016
Categories
Keywords
-
No keywords were submitted.
Target Audience
-
No target audience selected.