Implementation of a steepest-edge primal-dual simplex method for network linear programs
type: Item
instance of: scholarly article
title: Implementation of a steepest-edge primal-dual simplex method for network linear programs
zbMATH Open document ID: 0911.90151
DOI: 10.1023/A:1018905123635
author: Norman D. Curet
published in: Annals of Operations Research
publication date: 1998-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1202743
zbMATH Keywords: network flow problem
zbMATH Keywords: computational methods
zbMATH Keywords: primal-dual simplex variant
zbMATH Keywords: generalized network problem
zbMATH Keywords: uncapacitated transportation
zbMATH Keywords: transshipment
MaRDI profile type: Publication
full work available at URL: a:1018905123635
OpenAlex ID: W170265350
description: scientific article; zbMATH DE number 1202743