A simplex algorithm for a class of Leontief flow problems
From MaRDI portal
Publication:1381763
DOI10.1016/0895-7177(96)00128-8zbMath0895.90086OpenAlexW2044421962MaRDI QIDQ1381763
Publication date: 1 April 1998
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(96)00128-8
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An application of simultaneous diophantine approximation in combinatorial optimization
- Gainfree Leontief substitution flow problems
- Directed hypergraphs and applications
- Extreme points of Leontief substitution systems
- 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
This page was built for publication: A simplex algorithm for a class of Leontief flow problems
