Computational techniques of the simplex method
From MaRDI portal
Recommendations
- Computational aspects of linear programming simplex method
- scientific article; zbMATH DE number 3188915
- scientific article; zbMATH DE number 1064581
- The complexity of the simplex method
- scientific article; zbMATH DE number 653033
- A numerically exact implementation of the simplex method
- scientific article; zbMATH DE number 5251052
- Simplex algorithms for linear programming
- scientific article; zbMATH DE number 778138
Cited in
(32)- Efficient nested pricing in the simplex algorithm
- Permutations in the Factorization of Simplex Bases
- A largest-distance pivot rule for the simplex algorithm
- Exterior point simplex-type algorithms for linear and network optimization problems
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- scientific article; zbMATH DE number 653033 (Why is no real title available?)
- The Efficiency of the Simplex Method: A Survey
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Feasibility pump 2.0
- scientific article; zbMATH DE number 4049374 (Why is no real title available?)
- A regularized simplex method
- Solving two-stage stochastic programming problems with level decomposition
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Computational aspects of linear programming simplex method
- Efficient optimization of the reward-risk ratio with polyhedral risk measures
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- A numerically exact implementation of the simplex method
- Interpolation-based model order reduction for polynomial systems
- Circular coloring of graphs via linear programming and tabu search
- Central path curvature and iteration-complexity for redundant Klee-Minty cubes
- Computational study of the GDPO dual phase-1 algorithm
- An advanced macro spreadsheet program for the simplex method
- Implementation aids for optimization algorithms that solve sequences of linear programs
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
- Scaling linear optimization problems prior to application of the simplex method
- Linear programming computation
- Parallel search paths for the simplex algorithm
- Interior point methods 25 years later
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- Parallel distributed-memory simplex for large-scale stochastic LP problems
This page was built for publication: Computational techniques of the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860337)
