Pages that link to "Item:Q920841"
From MaRDI portal
The following pages link to An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841):
Displayed 50 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- Interior path following primal-dual algorithms. I: Linear programming (Q1123121) (← links)
- Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- A combinatorial interior point method for network flow problems (Q1196185) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models (Q1207805) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
- Solving linear programming problems exactly (Q1354256) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- On linear programming and matrix scaling over the algebraic numbers (Q1361844) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337) (← links)
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. (Q1569192) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- An interactive interior point algorithm for multiobjective linear programming problems (Q1604044) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
- Polynomial affine algorithms for linear programming (Q1814590) (← links)
- A simple complexity proof for a polynomial-time linear programming algorithm (Q1824548) (← links)
- A projection cutting plane algorithm for convex programming problems (Q1914623) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- A direct heuristic algorithm for linear programming (Q1971659) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- A note on the subtree ordered median problem in networks based on nestedness property (Q2358843) (← links)
- An exterior-point method for linear programming problems (Q2564164) (← links)
