Pages that link to "Item:Q2707294"

The following pages link to On the existence of a short admissible pivot sequence for feasibility and linear optimization problems (Q2707294):

Displaying 8 items.

• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384507) (← links)
• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Computing monotone disjoint paths on polytopes (Q1016050) (← links)
• Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
• Diameters of cocircuit graphs of oriented matroids: an update (Q2121728) (← links)
• On the existence of a short pivoting sequence for a linear program (Q2661547) (← links)
• The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP (Q3842984) (← links)
• A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (Q6660154) (← links)