An efficient generalized network-simplex-based algorithm for manufacturing network flows

DOI10.1007/s10878-007-9080-6zbMath1144.90328OpenAlexW2064068441MaRDI QIDQ927190

Kamlesh Mathur, Prahalad Venkateshan, Ronald H. Ballou

Publication date: 4 June 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9080-6

zbMATH Keywords

Network flowsGeneralized network-simplex methodManufacturing networks

Mathematics Subject Classification ID

Production models (90B30) Deterministic network models in operations research (90B10)

Related Items

A polynomial local optimality condition for the concave piecewise linear network flow problem ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ 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 ⋮ Maximum flows in generalized processing networks

Uses Software

• VRP

Cites Work

• A network simplex algorithm for simple manufacturing network model
• Some further results on minimum distribution cost flow problems
• The Vehicle Routing Problem
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• Multicommodity Distribution System Design by Benders Decomposition

This page was built for publication: An efficient generalized network-simplex-based algorithm for manufacturing network flows