Pages that link to "Item:Q4361490"
From MaRDI portal
The following pages link to Combining Interior-Point and Pivoting Algorithms for Linear Programming (Q4361490):
Displaying 12 items.
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- A new efficient primal dual simplex algorithm (Q1868820) (← links)
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) (← links)
- A new least square algorithm for linear programming (Q2505271) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- An experimental investigation of a primal–dual exterior point simplexalgorithm (Q2868925) (← links)
- A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains (Q5244857) (← links)
- Experiments with a hybrid interior point/combinatorial approach for network flow problems (Q5436921) (← links)
- Combined projected gradient algorithm for linear programming (Q5481683) (← links)
- An efficient search direction for linear programming problems (Q5955478) (← links)