scientific article; zbMATH DE number 515933
From MaRDI portal
Publication:4283447
Iterative numerical methods for linear systems (65F10) Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)
Recommendations
- An efficient implementation of the network simplex method
- A computational comparison of the network simplex method with the dual affine scaling method
- scientific article; zbMATH DE number 515929
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- scientific article; zbMATH DE number 1086915
Cited in
(26)- A primal-dual interior point method whose running time depends only on the constraint matrix
- Applying steepest-edge techniques to a network primal-dual algorithm
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- Superlinear convergence of the affine scaling algorithm
- A Simple Efficient Interior Point Method for Min-Cost Flow
- scientific article; zbMATH DE number 4131543 (Why is no real title available?)
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- On a dual network exterior point simplex type algorithm and its computational behavior
- An efficient implementation of the network simplex method
- Efficient points on a network
- scientific article; zbMATH DE number 515929 (Why is no real title available?)
- scientific article; zbMATH DE number 515931 (Why is no real title available?)
- scientific article; zbMATH DE number 515932 (Why is no real title available?)
- scientific article; zbMATH DE number 679872 (Why is no real title available?)
- scientific article; zbMATH DE number 1086915 (Why is no real title available?)
- An annotated bibliography of network interior point methods
- Fortran subroutines for network flow optimization using an interior point algorithm
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- A computational comparison of the network simplex method with the dual affine scaling method
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 Q4283447)
