dabeenl_Tepper_2019.pdf (2.92 MB)

Cutting Planes and Integrality of Polyhedra: Structure and Complexity

Download (2.92 MB)
thesis
posted on 20.08.2019 by Dabeen Lee
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of two main parts: the first part is on the theory of cutting planes for integer linear programming, while the second part is on the theory of ideal clutters in combinatorial optimization.Cutting planes for an integer linear program are linear inequalities that are valid for all integer feasible solutions but possibly violated by some solutions to the linear programming relaxation.

History

Date

01/05/2019

Degree Type

Dissertation

Department

Tepper School of Business

Degree Name

  • Doctor of Philosophy (PhD)

Advisor(s)

Gérard Cornuéjols

Exports

Exports