Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Cut generating function"”.

  1. On the development of cut-generating functions

    Cut-generating functions are tools for producing cutting planes for generic mixed-integer sets. Historically, cutting planes have advanced the progress of algorithms for solving mixed- integer programs. When used alone, cutting-planes provide a finite time algorithm for solving a large family of …

    jhu Repository record for On the development of cut-generating functions (opens in a new tab)

  2. Strong convex relaxations for quadratically constrained quadratic programs

    In Chapter 2 of the thesis, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear programs can easily be adapted to give the integer hull of the conic integer program. We then introduce a new …

    gatech Repository record for Strong convex relaxations for quadratically constrained quadratic programs (opens in a new tab)