Parallel algorithms for the maximum flow problem with minimum lot sizes

DOI10.1007/978-3-642-29210-1_14MaRDI QIDQ5176286zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Parallel primal-dual methods for the minimum cost flow problem
• Efficient parallel algorithms for the minimum cost flow problem
• Sequential and parallel algorithms for minimum flows.
• More efficient parallel flow algorithms
• Complexity and approximability of the maximum flow problem with minimum quantities

Cites work

• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• A new approach to the maximum-flow problem
• An O(n2log n) parallel max-flow algorithm
• Graphs, networks and algorithms
• Parallel algorithms for the maximum flow problem with minimum lot sizes

Cited in

(4)

• Inverse shortest path models based on fundamental cycle bases
• Parallel algorithms for the maximum flow problem with minimum lot sizes
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Efficient parallel algorithms for the minimum cost flow problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176286)