Applying steepest-edge techniques to a network primal-dual algorithm
From MaRDI portal
(Redirected from Publication:1362969)
Recommendations
- Implementation of a steepest-edge primal-dual simplex method for network linear programs
- scientific article; zbMATH DE number 4174642
- A unified framework for primal-dual methods in minimum cost network flow problems
- An efficient implementation of the network simplex method
- A new strongly polynomial dual network simplex algorithm
Cites work
- scientific article; zbMATH DE number 515927 (Why is no real title available?)
- scientific article; zbMATH DE number 515928 (Why is no real title available?)
- scientific article; zbMATH DE number 515933 (Why is no real title available?)
- A polynomially bounded algorithm for a singly constrained quadratic program
- A primal-dual simplex method for linear programs
- An incremental primal-dual method for generalized networks
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Steepest-edge simplex algorithms for linear programming
Cited in
(2)
This page was built for publication: Applying steepest-edge techniques to a network primal-dual algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362969)