A simplex algorithm for a class of Leontief flow problems
From MaRDI portal
Recommendations
- A Strongly Polynomial Algorithm for a Special Class of Linear Programs
- Gainfree Leontief substitution flow problems
- On the simplex algorithm for networks and generalized networks
- A strongly polynomial time algorithm for an LP problem with a pre-Leontief coefficient matrix
- A polynomial-time simplex method for the maximum \(k\)-flow problem
Cites work
- An application of simultaneous diophantine approximation in combinatorial optimization
- Directed hypergraphs and applications
- Extreme points of Leontief substitution systems
- Gainfree Leontief substitution flow problems
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3495849 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- On the simplex algorithm for networks and generalized networks
- Optimality of Stationary Halting Policies and Finite Termination of Successive Approximations
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Theoretical Properties of the Network Simplex Method
Cited in
(6)- Gainfree Leontief substitution flow problems
- scientific article; zbMATH DE number 4037557 (Why is no real title available?)
- A Strongly Polynomial Algorithm for a Special Class of Linear Programs
- A strongly polynomial time algorithm for an LP problem with a pre-Leontief coefficient matrix
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
This page was built for publication: A simplex algorithm for a class of Leontief flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381763)
