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 3 of 3 for “"Polyhedral Theory"”.

  1. The Gomory-Chvátal closure : polyhedrality, complexity, and extensions

    … a polytope. Schrijver (1980) had established the polyhedrality of the Gomory-Chvdtal closure for rational polyhedra. In essence, his proof relies on the fact that the set of integer points in a rational polyhedral cone is generated by a finite subset of these points. This is not true for …

    mit Repository record for The Gomory-Chvátal closure : polyhedrality, complexity, and extensions (opens in a new tab)

  2. Generating cutting planes through inequality merging on multiple variables in knapsack problems

    Integer programming is a field of mathematical optimization that has applications across a wide variety of industries and fields including business, government, health care and military. A commonly studied integer program is the knapsack problem, which has applications including project and …

    ksu Repository record for Generating cutting planes through inequality merging on multiple variables in knapsack problems (opens in a new tab)

  3. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets

    A set of n-dimensional integral vectors, Nn, is said to be right-closed if for any x 2 , any vector y x also belongs to it. An integral-set Nn is convex if and only if there is a convex set C Rn such that = Int(C), where Int( ) denotes the integral points in the set argument. In this dissertation, …

    uiuc Repository record for On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets (opens in a new tab)