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.
- Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
- Active constraint set invariancy sensitivity analysis in linear optimization (Q946305) (← links)
- Euclidean centers: Computation, properties and a MOLP application (Q949532) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
- An interior-point algorithm for nonlinear minimax problems (Q963659) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Sparse QR factorization on a massively parallel computer (Q973426) (← links)
- A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
- A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
- Extension of a projective interior point method for linearly constrained convex programming (Q990634) (← links)
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
- Finding positive matrices subject to linear restrictions (Q996327) (← links)
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation (Q999133) (← links)
- Open problems in computational linear algebra (Q999481) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- Predictive control for hybrid systems. Implications of polyhedral pre-computations (Q1003540) (← links)
- The \(C^m\) norm of a function with prescribed jets. II (Q1017346) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Partially observable Markov decision processes with imprecise parameters (Q1028935) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- Consistency of a linear system of inequalities (Q1061454) (← links)
- Applications of fuzzy set theory to mathematical programming (Q1066822) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- Graph isomorphism and theorems of Birkhoff type (Q1068104) (← links)
- Intelligent gradient search in linear programming (Q1071647) (← links)
- An introduction to the analysis of approximation algorithms (Q1076513) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- A different convergence proof of the projective method for linear programming (Q1088902) (← links)
- A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm (Q1089251) (← links)
- The iterative step in the linear programming algorithm of N. Karmarkar (Q1089252) (← links)
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections (Q1090599) (← links)
- An extension of Karmarkar's algorithm for linear programming using dual variables (Q1090601) (← links)
- Karmarkar's algorithm and its place in applied mathematics (Q1091259) (← links)
- Homotopy techniques in linear programming (Q1091937) (← links)
- A projective method for linear programming with box-type constraints (Q1092806) (← links)
- Computational experience with a dual affine variant of Karmarkar's method for linear programming (Q1092808) (← links)
- An LP-based successive overrelaxation method for linear complementarity problems (Q1093555) (← links)
- A polynomial Newton method for linear programming (Q1094330) (← links)
- Karmarkar's algorithm and the ellipsoid method (Q1095025) (← links)
- Convergence results and numerical experiments on a linear programming hybrid algorithm (Q1095026) (← links)
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028) (← links)
- Implementing an affine scaling algorithm for linear programming (Q1097168) (← links)
- A new family of exponential LP problems (Q1097169) (← links)
