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 “"Mixed integer knapsack"”.

  1. Cutting Planes for Large Mixed Integer Programming Models

    … this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with cutting planes for the Traveling Salesman Problem (TSP), and the second with cutting planes for general …

    gatech Repository record for Cutting Planes for Large Mixed Integer Programming Models (opens in a new tab)

  2. Single-row mixed-integer programs: theory and computations

    Single-row mixed-integer programming (MIP) problems have been studied thoroughly under many different perspectives over the years. While not many practical applications can be modeled as a single-row MIP, their importance lies in the fact that they are simple, natural and very useful relaxations of …

    gatech Repository record for Single-row mixed-integer programs: theory and computations (opens in a new tab)