A network simplex algorithm for solving the minimum distribution cost problem

DOI10.3934/jimo.2009.5.929zbMath1183.90079OpenAlexW1984507144MaRDI QIDQ2379832

I-Lin Wang, Shiou-Jie Lin

Publication date: 22 March 2010

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2009.5.929

zbMATH Keywords

network optimizationdistribution networknetwork simplex algorithmmanufacturing networkminimum distribution cost flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (3)

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

This page was built for publication: A network simplex algorithm for solving the minimum distribution cost problem