Pages that link to "Item:Q761967"
From MaRDI portal
The following pages link to A new polynomial-time algorithm for linear programming (Q761967):
Displaying 50 items.
- Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks (Q1098761) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- A multiplicative barrier function method for linear programming (Q1101008) (← links)
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value (Q1103522) (← links)
- A fully polynomial time projective method (Q1104857) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope (Q1106099) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems (Q1107277) (← links)
- Computing Karmarkar projections quickly (Q1107438) (← links)
- Performance evaluation of concurrent systems using conflict-free and persistent Petri nets (Q1108799) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- Some remarks on Karmarkar's potential function (Q1109675) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- On the convexity of the multiplicative version of Karmarkar's potential function (Q1111466) (← links)
- On scaled projections and pseudoinverses (Q1111643) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Eliminating columns in the simplex method for linear programming (Q1113797) (← links)
- An analysis of an available set of linear programming test problems (Q1113798) (← links)
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm (Q1113799) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
- Projection method for solving systems of linear inequalities (Q1116653) (← links)
- Conical projection algorithms for linear programming (Q1117835) (← links)
- Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- Interior path following primal-dual algorithms. I: Linear programming (Q1123121) (← links)
- Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- Least squares matching problems (Q1123133) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- An interior point algorithm for semi-infinite linear programming (Q1123804) (← links)
- On the augmented system approach to sparse least-squares problems (Q1124275) (← links)
- Are analog neural networks better than binary neural networks? (Q1126906) (← links)
- Solving a class of LP problems with a primal-dual logarithmic barrier method (Q1129972) (← links)
- Solving a bilevel linear program when the inner decision maker control few variables (Q1130082) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- Decomposing finitely generated integral monoids by elimination (Q1175279) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- A new approach to uncertain parameter linear programming (Q1179011) (← links)
- Solving linear programming problems via linear minimax problems (Q1180710) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
