Efficient algorithm for minimum cost flow problem with partial lane reversals

MaRDI QIDQ5040189zbMATH OpenFDO

Authors Urmila Pyakurel

Publication date 11 October 2022

zbMATH Keywords

complexityefficient algorithmminimum cost flowpartial contraflow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Recommendations

• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• On dual minimum cost flow algorithms
• scientific article; zbMATH DE number 1918689
• Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
• Minimum-cost dynamic flows: The series-parallel case

Cited in

(2)

• Multi-commodity flow problem on lossy network with partial lane reversals
• Complexity analysis for maximum flow problems with arc reversals

This page was built for publication: Efficient algorithm for minimum cost flow problem with partial lane reversals

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