Pages that link to "Item:Q4165158"
From MaRDI portal
The following pages link to The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158):
Displaying 44 items.
- A linear programming decomposition focusing on the span of the nondegenerate columns (Q319585) (← links)
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
- Branch and bound, integer, and non-integer programming (Q537592) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Implementations of special ordered sets in MP software (Q792884) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- On the use of the simplex algorithm for the absolute deviation curve fitting problem (Q1056519) (← links)
- A general phase-I method in linear programming (Q1069441) (← links)
- Convergence results and numerical experiments on a linear programming hybrid algorithm (Q1095026) (← links)
- A dual approach to primal degeneracy (Q1102188) (← links)
- On maintenance scheduling of production units (Q1159562) (← links)
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
- A fast LU update for linear programming (Q1309856) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Encounters with degeneracy: A personal view (Q1312770) (← links)
- MOPS -- Mathematical optimization system (Q1317161) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Cycling in linear programming problems (Q1765542) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- A pathological case in the reduction of linear programs (Q1837107) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis (Q2802253) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- Formal optimization of some reduced linear programming problems (Q3320119) (← links)
- Karmarkar's projective method for linear programming: a computational survey (Q3491310) (← links)
- On scaling linear programs—some experimental results (Q3835674) (← links)
- Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion (Q3901311) (← links)
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming (Q3922472) (← links)
- Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
- Updated triangular factors of the working basis in winkler's decomposition approach (Q3964320) (← links)
- Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit (Q4983284) (← links)
- Solving Linear Programs in Polynomial-Time (Q5904766) (← links)
- Solving Linear Programs in Polynomial-Time (Q5904768) (← links)
- Complexity of the gravitational method for linear programming (Q5942223) (← links)
