Pages that link to "Item:Q1802952"

The following pages link to Steepest-edge simplex algorithms for linear programming (Q1802952):

Displaying 49 items.

• The positive edge pricing rule for the dual simplex (Q337606) (← links)
• Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
• The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
• Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
• Efficient nested pricing in the simplex algorithm (Q943787) (← links)
• A computational approach to pivot selection in the LP relaxation of set problems (Q955467) (← links)
• Towards a practical parallelisation of the simplex method (Q970132) (← links)
• Computational study of the GDPO dual phase-1 algorithm (Q970138) (← links)
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
• A dual projective simplex method for linear programming (Q1129474) (← links)
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
• ABS algorithms for linear equations and optimization (Q1593821) (← links)
• Advances in design and implementation of optimization software (Q1598765) (← links)
• A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
• Parallelizing the dual revised simplex method (Q1646685) (← links)
• Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
• On the sparseness of 1-norm support vector machines (Q1784565) (← links)
• A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
• An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
• Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
• A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740) (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) (← links)
• Fast quantum subroutines for the simplex method (Q2061891) (← links)
• A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
• Computing in combinatorial optimization (Q2075761) (← links)
• The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← links)
• Reinforcement learning of simplex pivot rules: a proof of concept (Q2080843) (← links)
• Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
• A computationally stable solution algorithm for linear programs (Q2372034) (← links)
• Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
• A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
• A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
• Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
• A new least square algorithm for linear programming (Q2505271) (← links)
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
• An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
• Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision (Q3462312) (← links)
• The implicit LX method of the ABS class (Q4380561) (← links)
• Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
• LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
• Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• Permutations in the Factorization of Simplex Bases (Q5139619) (← links)
• Linear programing formulations and algorithms for radiotherapy treatment planning (Q5478868) (← links)
• Primal-dual methods for sustainable harvest scheduling problems (Q5953164) (← links)