Pages that link to "Item:Q1040845"

The following pages link to Graphs of transportation polytopes (Q1040845):

Displaying 19 items.

• On the closest point to the origin in transportation polytopes (Q299056) (← links)
• Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
• On the diameter of partition polytopes and vertex-disjoint cycle cover (Q378108) (← links)
• Multiindex transportation problems with 2-embedded structure (Q384500) (← links)
• Three-index linear programs with nested structure (Q664295) (← links)
• On the shadow simplex method for curved polyhedra (Q728496) (← links)
• The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
• The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
• Multistationarity in the space of total concentrations for systems that admit a monomial parametrization (Q2008268) (← links)
• Multi-index transport problems with decomposition structure (Q2261688) (← links)
• The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
• The value function of a transportation problem (Q2670483) (← links)
• A Lower Bound Technique for Triangulations of Simplotopes (Q4601211) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• Constructing Clustering Transformations (Q5150815) (← links)
• More bounds on the diameters of convex polytopes (Q5299904) (← links)
• On sub-determinants and the diameter of polyhedra (Q5891422) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965566) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)