A note on a generalized network flow model for manufacturing process

DOI10.1007/s10255-005-5157-7zbMath1173.90337OpenAlexW2027420053MaRDI QIDQ1036893

Binwu Zhang, Enyu Yao, Haiyan Lu

Publication date: 13 November 2009

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-005-5157-7

zbMATH Keywords

partially ordered setnetwork simplex methodminimum cost network flowextended cycleinitial basic feasible solution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks ⋮ Maximum flows in generalized processing networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial time primal network simplex algorithm for minimum cost flows
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• On the simplex algorithm for networks and generalized networks