A simplex algorithm for a class of Leontief flow problems
type: Item
instance of: scholarly article
title: A simplex algorithm for a class of Leontief flow problems
zbMATH Open document ID: 0895.90086
DOI: 10.1016/0895-7177(96)00128-8
author: D. Massart
published in: Mathematical and Computer Modelling
publication date: 1998-04-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1135899
zbMATH Keywords: Leontief flow problem
zbMATH Keywords: simplex method
MaRDI profile type: Publication
full work available at URL: 0895-7177(96)00128-8
OpenAlex ID: W2044421962
cites work: Q4051879
cites work: Q3056948
cites work: On the simplex algorithm for networks and generalized networks
cites work: Gainfree Leontief substitution flow problems
cites work: Extreme points of Leontief substitution systems
cites work: Q4077718
cites work: Optimality of Stationary Halting Policies and Finite Termination of Successive Approximations
cites work: Directed hypergraphs and applications
cites work: Theoretical Properties of the Network Simplex Method
cites work: Q5340130
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: An application of simultaneous diophantine approximation in combinatorial optimization
description: scientific article; zbMATH DE number 1135899