Pages that link to "Item:Q1860337"
From MaRDI portal
The following pages link to Computational techniques of the simplex method (Q1860337):
Displayed 10 items.
- Interior point methods 25 years later (Q439546) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- Computational study of the GDPO dual phase-1 algorithm (Q970138) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
- Solving two-stage stochastic programming problems with level decomposition (Q2468771) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)