The following pages link to (Q5629405):
Displayed 22 items.
- The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- Experiments with external pivoting (Q909578) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- Adjacent vertex simplex algorithms: More experimental results on random problems (Q1321806) (← links)
- Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- Gaining traction: on the convergence of an inner approximation scheme for probability maximization (Q2045616) (← links)
- Reinforcement learning of simplex pivot rules: a proof of concept (Q2080843) (← links)
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
- Heights of convex polytopes (Q2395715) (← links)
- A class of linear programming problems requiring a large number of iterations (Q2395976) (← links)
- Nonadjacent extreme point methods for solving linear programs (Q3673477) (← links)
- Affirmative action algorithms (Q3725860) (← links)
- A practicable steepest-edge simplex algorithm (Q3887219) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
- Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
- Some Results on Sparse Matrices (Q5641963) (← links)
- Reinversion with the preassigned pivot procedure (Q5659039) (← links)
- On the solution of linear equation/inequality systems (Q5663631) (← links)
- Pivot selection methods of the Devex LP code (Q5677274) (← links)
- Complexity of the gravitational method for linear programming (Q5942223) (← links)