Pages that link to "Item:Q5677274"
From MaRDI portal
The following pages link to Pivot selection methods of the Devex LP code (Q5677274):
Displayed 50 items.
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Experiments with external pivoting (Q909578) (← links)
- An efficient approach to updating simplex multipliers in the simplex algorithm (Q927163) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← 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 general phase-I method in linear programming (Q1069441) (← links)
- Degeneracy in the presence of roundoff errors (Q1105984) (← links)
- The simplex method is not always well behaved (Q1109528) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Resolving degeneracy in quadratic programming (Q1312769) (← links)
- Encounters with degeneracy: A personal view (Q1312770) (← links)
- A practical anti-degeneracy row selection technique in network linear programming (Q1312776) (← links)
- MOPS -- Mathematical optimization system (Q1317161) (← links)
- Adjacent vertex simplex algorithms: More experimental results on random problems (Q1321806) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
- Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← 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)
- A pathsearch damped Newton method for computing general equilibria (Q2365112) (← links)
- A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769) (← links)
- Solving Large Scale Generalized Networks (Q3682271) (← links)
- On Estimating Optimal Bases for Linear Programs (Q3731365) (← links)
- A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
- A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
- A practicable steepest-edge simplex algorithm (Q3887219) (← links)
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung (Q4070995) (← links)
- Experiments in mixed-integer linear programming using pseudo-costs (Q4136935) (← links)
- On the Bartels—Golub decomposition for linear programming bases (Q4158808) (← links)
- Testing of a large-scale network optimization program (Q4171521) (← links)
- On pricing and backward transformation in linear programming (Q4404659) (← links)
- On a dual method for a specially structured linear programming problem with application to stochastic programming (Q4709734) (← links)
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
- Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
- Linear programing formulations and algorithms for radiotherapy treatment planning (Q5478868) (← links)
- Primal-dual methods for sustainable harvest scheduling problems (Q5953164) (← links)