Pages that link to "Item:Q1181908"
From MaRDI portal
The following pages link to A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908):
Displaying 8 items.
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Some variants of the Todd low-complexity algorithm (Q1904958) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
