An incremental primal-dual method for generalized networks
From MaRDI portal
(Redirected from Publication:1342940)
Recommendations
Cites work
- A polynomially bounded algorithm for a singly constrained quadratic program
- A primal-dual simplex method for linear programs
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Network flows. Theory, algorithms, and applications.
- New labeling procedures for the basis graph in generalized networks
- Relaxation Methods for Linear Programs
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Solving Generalized Networks
- Solving Large Scale Generalized Networks
Cited in
(8)- New labeling procedures for the basis graph in generalized networks
- Implementation of a steepest-edge primal-dual simplex method for network linear programs
- Applying steepest-edge techniques to a network primal-dual algorithm
- A primal-dual algorithm for monotropic programming and its application to network optimization
- Solving Large Scale Generalized Networks
- scientific article; zbMATH DE number 1054678 (Why is no real title available?)
- On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method
- A primal-dual simplex method for linear programs
This page was built for publication: An incremental primal-dual method for generalized networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342940)