Pages that link to "Item:Q4305758"
From MaRDI portal
The following pages link to A Monotonic Build-Up Simplex Algorithm for Linear Programming (Q4305758):
Displaying 17 items.
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- The simplex algorithm with a new primal and dual pivot rule (Q1342283) (← links)
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm (Q1374385) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- A minimum-ratio-test-free approach to linear programming (Q1823855) (← links)
- A new efficient primal dual simplex algorithm (Q1868820) (← links)
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming (Q1926882) (← links)
- A space decomposition-based deterministic algorithm for solving linear optimization problems (Q2306623) (← links)
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds (Q5413870) (← links)
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (Q5413871) (← links)
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)
