scientific article; zbMATH DE number 3283574
From MaRDI portal
Publication:5567241
Cited in
(8)- A comparison of interval linear programming with the simplex method
- An artificial-free simplex-type algorithm for general LP models
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Solving Linear Programs in Polynomial-Time
- Solving Linear Programs in Polynomial-Time
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5567241)