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 “"Diameter of Polytopes"”.

  1. 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)

  2. Combinatorial Optimization and Discrete Geometry Approaches for Half-Integral Polytopes

    The study of the combinatorial structure of polyhedra, in particular the maximal edge-diameter in terms of dimension and of the number of its facets, is a key element of discrete geometry. Polyhedral diameter is also related to the simplex method, as diameter is a lower bound on the worst-case …

    toronto-retro Repository record for Combinatorial Optimization and Discrete Geometry Approaches for Half-Integral Polytopes (opens in a new tab)

  3. Computational and Geometric Aspects of Linear Optimization

    … a feasible region defined as the intersection of a finite number of hyperplanes. Pivot-based simplex methods and central-path following interior point methods are the computationally most efficient algorithms to solve linear optimization instances. Discrete optimization further assumes that …

    mcmaster Repository record for Computational and Geometric Aspects of Linear Optimization (opens in a new tab)