Pages that link to "Item:Q3887219"

The following pages link to A practicable steepest-edge simplex algorithm (Q3887219):

Displaying 50 items.

• A linear programming decomposition focusing on the span of the nondegenerate columns (Q319585) (← links)
• Algebraic simplex initialization combined with the nonfeasible basis method (Q319588) (← links)
• The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
• New crash procedures for large systems of linear constraints (Q584077) (← links)
• Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
• On the equivalence of the simplex methods and a multiplier-alike method for linear programming (Q700716) (← links)
• A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
• Practical finite pivoting rules for the simplex method (Q751498) (← links)
• A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\) (Q789142) (← links)
• Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
• Canonical bases in linear programming (Q908850) (← links)
• A ``build-down'' scheme for linear programming (Q912758) (← 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)
• Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
• Towards a practical parallelisation of the simplex method (Q970132) (← links)
• An overview on the simplex algorithm (Q1021548) (← links)
• A Z-simplex algorithm with partial updates (Q1097835) (← links)
• On the choice of the pivot columns of the simplex-method: Gradient criteria (Q1097836) (← links)
• A relaxed version of Karmarkar's method (Q1108926) (← links)
• The simplex method is not always well behaved (Q1109528) (← links)
• Worst case behavior of the steepest edge simplex method (Q1134626) (← links)
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications (Q1184346) (← links)
• A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
• MOPS -- Mathematical optimization system (Q1317161) (← links)
• Adjacent vertex simplex algorithms: More experimental results on random problems (Q1321806) (← links)
• A linear programming approach to reasoning about probabilities (Q1356219) (← links)
• Advances in design and implementation of optimization software (Q1598765) (← links)
• Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
• Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
• A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
• A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740) (← links)
• Solving linear programs with multiple right-hand sides: Pricing and ordering schemes (Q1918430) (← links)
• Empirical column selection method in the simplex method (Q1918777) (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) (← links)
• Computing in combinatorial optimization (Q2075761) (← links)
• Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
• A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
• Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
• Upper bound limit analysis using discontinuous velocity fields (Q2564590) (← links)
• Improved primal simplex: a more general theoretical framework and an extended experimental analysis (Q2802253) (← links)
• A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
• On scaling linear programs—some experimental results (Q3835674) (← links)
• A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
• On the Bartels—Golub decomposition for linear programming bases (Q4158808) (← links)
• Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• Primal-dual methods for sustainable harvest scheduling problems (Q5953164) (← links)
• Optimal pivot path of the simplex method for linear programming based on reinforcement learning (Q6564764) (← links)