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 “"Corner polyhedra"”.

  1. A group theoretic approach to metaheuristic local search for partitioning problems

    … the ILP. We describe the local search for the corner polyhedron in the space of the non-basic variables. Integer points in the corner polyhedron that produce an all integer basis form a sub-lattice. We develop identity move neighborhoods that allow the local search to traverse this sub-lattice. …

    texas Repository record for A group theoretic approach to metaheuristic local search for partitioning problems (opens in a new tab)

  2. Cutting planes in mixed integer programming: theory and algorithms

    … mixed integer cut from the perspective of group polyhedra. In this setting, the mixed integer cut appears as a facet of the master cyclic group polyhedron. Our chief contribution is a characterization of the adjacent facets and the extreme points of the mixed integer cut. This provides insight …

    gatech Repository record for Cutting planes in mixed integer programming: theory and algorithms (opens in a new tab)