Pages that link to "Item:Q2463487"
From MaRDI portal
The following pages link to A largest-distance pivot rule for the simplex algorithm (Q2463487):
Displaying 10 items.
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- Book review of: P.-Q. Pan, Linear programming computation (Q1754296) (← links)
- Reinforcement learning of simplex pivot rules: a proof of concept (Q2080843) (← links)
- A Fast Algorithm for Linear Programming (Q3110369) (← links)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
- Optimal pivot path of the simplex method for linear programming based on reinforcement learning (Q6564764) (← links)