The following pages link to (Q4188659):
Displaying 32 items.
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
- An interior feasible direction method with constraint projections for linear programming (Q804468) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028) (← links)
- A multiplicative barrier function method for linear programming (Q1101008) (← links)
- Survey of solved and open problems in the degeneracy phenomenon (Q1101009) (← links)
- A dual approach to primal degeneracy (Q1102188) (← links)
- Computational behavior of a feasible direction method for linear programming (Q1119474) (← links)
- Worst case behavior of the steepest edge simplex method (Q1134626) (← links)
- On anti-cycling pivoting rules for the simplex method (Q1178727) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Estimating the number of vertices of a polyhedron (Q1607035) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- Reverse search for enumeration (Q1917258) (← links)
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- Randomly generated polytopes for testing mathematical programming algorithms (Q3664841) (← links)
- Affirmative action algorithms (Q3725860) (← links)
- The Average number of pivot steps required by the Simplex-Method is polynomial (Q3950310) (← links)
- Random polytopes: Their definition, generation and aggregate properties (Q3953557) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- The Klee–Minty random edge chain moves with linear speed (Q5297136) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
