scientific article; zbMATH DE number 3561084
From MaRDI portal
Publication:4132007
Cited in
(14)- Nonadjacent extreme point methods for solving linear programs
- On scaling linear programs—some experimental results
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Solving large-scale linear programs by aggregation
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
- Scaling linear optimization problems prior to application of the simplex method
- Computing optimal scalings by parametric network algorithms
- Scaling nonlinear programs
- Numerical behavior of LP algorithms based upon the decomposition principle
- MOPS -- Mathematical optimization system
- Applications of shortest path algorithms to matrix scalings
- Variational inequality model for the simulation of gas transmission networks
- Efficient GPU-based implementations of simplex type algorithms
- Characterizations of optimal scalings of matrices
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 Q4132007)
