Everything about Multi-commodity flow problem

🧭 Start here: a 6-step reading path

1. Read the overview: Multi-commodity flow problemA 5-minute orientation
2. Skim a recent paper: A new multi-commodity flow model to optimize the robustness of the Gate Allocation ProblemInfluential work since 2022
3. Pick up a classic book: Handbook on international trade policyThe most-reprinted book on the subject
4. Read the landmark paper: The time constrained multi-commodity network flow problem and its application to liner shipping network designCited 92 times
5. Go sideways: Circulation problemA closely related topic
6. Go sideways: Approximate max-flow min-cut theoremA closely related topic

🏆 Landmark papers (most cited)

• The time constrained multi-commodity network flow problem and its application to liner shipping network design

  Christian Vad Karsten, David Pisinger, Stefan Ropke · 2015 · Transportation Research Part E: Logistics and Transportation Review · 92 citations

• Multi-commodity flow network model of the flight gate assignment problem

  Binod Maharjan, Timothy I. Matis · 2012 · Computers & Industrial Engineering · 54 citations

• Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

  Adam N. Letchford, Juan-José Salazar-González · 2015 · European Journal of Operational Research · 42 citations

• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem

  Siamak Moradi, Andrea Raith, Matthias Ehrgott · 2015 · European Journal of Operational Research · 29 citations

• The multi-commodity network flow problem with soft transit time constraints: Application to liner shipping

  Alessio Trivella, Francesco Corman, David F. Koza · 2021 · Transportation Research Part E: Logistics and Transportation Review · 29 citations

• A multi-commodity flow formulation for the generalized pooling problem

  Mohammed Alfaki, Dag Haugland · 2012 · Journal of Global Optimization · 24 citations

• A multi-commodity flow network design problem

  L.R. Foulds · 1981 · Transportation Research Part B: Methodological · 22 citations

• New multi-commodity flow formulations for the pooling problem

  Natashia Boland, Thomas Kalinowski, Fabian Rigterink · 2016 · Journal of Global Optimization · 22 citations

🆕 Influential since 2022

• A new multi-commodity flow model to optimize the robustness of the Gate Allocation Problem

  Ruixin Wang, Cyril Allignol, Nicolas Barnier · 2022 · Transportation Research Part C: Emerging Technologies · 20 citations

• Column generation for solving large scale multi-commodity flow problems for passenger transportation

  Benedikt Lienkamp, Maximilian Schiffer · 2024 · European Journal of Operational Research · 15 citations

• Multi-Objective Gate Allocation Problem Based on Multi-Commodity Network Flow Model

  Jinghan Du, Minghua Hu, Jianan Yin · 2022 · Applied Sciences · 9 citations

• Multi-commodity flow problem on lossy network with partial lane reversals

  Shiva Prakash Gupta, Urmila Pyakurel, Tanka Nath Dhamala · 2023 · Annals of Operations Research · 7 citations

• Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory

  Somayeh Khezri, Salman Khodayifar · 2023 · Computers & Operations Research · 7 citations

📚 Books worth reading

• Handbook on international trade policyWilliam A. Kerr, James D. Gaisford · 2007
• Approximation and Online AlgorithmsThomas Erlebach · 2013
• The best investment writingMebane T. Faber · 2018
• 📕THE PILLARS OF BANKINGJohn Chibaya Mbuya · 2008
• 📕ICCREM 2015Sweden) International Conference on Construction and Real Estate Management (2015 Luleå · 2015
• Introduction to making very big booksUnited States. Congress. Senate. Committee on Pensions · 2011
• A TOUR OF THE WORLDMalik Mansab Khan, Muhammad Rafique Abdul Aziz · 2025

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Circulation problem The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with…
• Approximate max-flow min-cut theorem In graph theory, approximate max-flow min-cut theorems concern the relationship between the maximum flow rate (max-flow) and the minimum cut (min-cut)…
• Price of anarchy The Price of Anarchy (PoA) is a concept in economics and game theory that measures how the efficiency of a system degrades due to selfish behavior of its…
• Flow network In graph theory, a flow network or a transportation network is a directed graph where each edge has a capacity and each edge receives a flow. The amount…
• Transshipment problem Transshipment problems form a subgroup of transportation problems, where transshipment is allowed. In transshipment, transportation may or must go through…
• Generalized distributive law The generalized distributive law (GDL) is a generalization of the distributive property which gives rise to a general message passing algorithm. It is…
• Backpressure routing In queueing theory, a discipline within the mathematical theory of probability, the backpressure routing algorithm is a method for directing traffic around…
• Block Wiedemann algorithm The block Wiedemann algorithm for computing kernel vectors of a matrix over a finite field is a generalization by Don Coppersmith of an algorithm due to…