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 “"Fractional Stable Set Polytope"”.

  1. On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope

    … N and N_0 while being applied recursively to the fractional stable set polytope of a graph. We focus on two related conjectures proposed by Liptak and Tuncel: the N-N_0 Conjecture and Rank Conjecture. First, we look at the algebraic derivation of new valid inequalities by the operators N and N_0. …

    waterloo Repository record for On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope (opens in a new tab)

  2. On The Circuit Diameters of Some Combinatorial Polytopes

    The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P is defined as the maximum value of a shortest path between two vertices of P, …

    waterloo Repository record for On The Circuit Diameters of Some Combinatorial Polytopes (opens in a new tab)

  3. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization

    … then approximate their feasible regions using sets that are easier to describe and optimize over. Two of the most prominent mathematical models that are used to obtain these approximations are linear programs (LPs) and semidefinite programs (SDPs). The study of these relaxations started to gain …

    waterloo Repository record for A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization (opens in a new tab)