A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost

zbMATH Open1324.90034MaRDI QIDQ5260182FDOQ5260182

Authors Weihua Kou, Haoying Cui

Publication date 29 June 2015

zbMATH Keywords

multicommodity flowtraffic networksuccessive shortest path algorithmminimum-cost flowcomposite indicatorsFord-Fulkerson algorithmcomposite parameters

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)

Recommendations

• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
• Multicommodity flows in tree-like networks
• scientific article; zbMATH DE number 3928682
• scientific article; zbMATH DE number 1187163

Cited in

(4)

• Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks
• Multicommodity flows in tree-like networks
• A trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems
• scientific article; zbMATH DE number 3928682 (Why is no real title available?)

This page was built for publication: A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost

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