Parallel algorithms for the maximum flow problem with minimum lot sizes

DOI10.1007/978-3-642-29210-1_14zbMATH Open1306.90015OpenAlexW951341154MaRDI QIDQ5176286FDOQ5176286

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A new approach to the maximum-flow problem
• Title not available (Why is that?)
• Graphs, networks and algorithms
• Title not available (Why is that?)
• An O(n2log n) parallel max-flow algorithm
• 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)