Parallel algorithms for the maximum flow problem with minimum lot sizes

DOI10.1007/978-3-642-29210-1_14zbMath1306.90015OpenAlexW951341154MaRDI QIDQ5176286

Mujahed Eleyat, Dag Haugland, Lasse Natvig, Magnus Lie Hetland

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_14

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items

Inverse Shortest Path Models Based on Fundamental Cycle Bases ⋮ Parallel algorithms for the maximum flow problem with minimum lot sizes

Cites Work

• Graphs, networks and algorithms
• A new approach to the maximum-flow problem
• An O(n2log n) parallel max-flow algorithm
• Parallel algorithms for the maximum flow problem with minimum lot sizes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel algorithms for the maximum flow problem with minimum lot sizes