A network simplex algorithm for simple manufacturing network model
From MaRDI portal
Publication:1780135
DOI10.3934/JIMO.2005.1.251zbMath1177.90055OpenAlexW2335057580MaRDI QIDQ1780135
Liqun Qi, Jiangtao Mo, Zeng-xin Wei
Publication date: 7 June 2005
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2005.1.251
Programming involving graphs or networks (90C35) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)
Related Items (3)
An efficient generalized network-simplex-based algorithm for manufacturing network flows ⋮ A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks ⋮ A specialized network simplex algorithm for the constrained maximum flow problem
This page was built for publication: A network simplex algorithm for simple manufacturing network model
