Get started
Keyword

multicommodity flow

Description: This is a network optimization problem that routes multiple types of flow between distinct source and destination nodes subject to network constraints.
Wikidata ID: wiki/Q6934437
OpenAlex ID: keywords/multi-commodity-flow
Linear Programming and Network Flows
1978 · C. R. Sergeant, Mokhtar S. Bazaraa, et al. · Journal of the Operational Research Society · 1,973
P-Complete Approximation Problems
1976 · Sartaj Sahni, Teofilo Gonzalez · Journal of the ACM · 1,705
PDF
On the Complexity of Timetable and Multicommodity Flow Problems
1976 · S. Even, A. Itai, et al. · SIAM Journal on Computing · 1,094
Geometry of Cuts and Metrics
1997 · Michel Marie Deza, Monique Laurent · Algorithms and combinatorics · 995
The geometry of graphs and some of its algorithmic applications
1995 · Nathan Linial, Eran London, et al. · COMBINATORICA · 952
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
1999 · Tom Leighton, Satish Rao · Journal of the ACM · 822
PDF
Emergency Logistics Planning in Natural Disasters
2004 · Linet Özdamar, Ediz Ekinci, et al. · Annals of Operations Research · 819
Parallel optimization: Theory, algorithms, and applications
1998 · Computers & Mathematics with Applications · 813
A dynamic logistics coordination model for evacuation and support in disaster response activities
2006 · Wei Yi, Linet Özdamar · European Journal of Operational Research · 735
Graphs And Algorithms
1984 · Gondran, Michel, Minoux, Michel · CERN Document Server (European Organization for Nuclear Research) · 636
Simultaneous Routing and Resource Allocation Via Dual Decomposition
2004 · L. Xiao, M. Johansson, et al. · IEEE Transactions on Communications · 562
The flow deviation method: An approach to store‐and‐forward communication network design
1973 · L. Fratta, M. Gerla, et al. · Networks · 562
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
2002 · N. Garg, J. Konemann · Annual Symposium on Foundations of Computer Science · 561
Virtual network embedding through topology-aware node ranking
2011 · Xiang Cheng, Sen Su, et al. · ACM SIGCOMM Computer Communication Review · 545
Fast Approximation Algorithms for Fractional Packing and Covering Problems
1995 · Serge A. Plotkin, David B. Shmoys, et al. · Mathematics of Operations Research · 542
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
2006 · L. Chen, S. H. Low, et al. · 532
A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems
1993 · M. P. Wellman · Journal of Artificial Intelligence Research · 526
PDF
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks
1996 · D. Banerjee, B. Mukherjee · IEEE Journal on Selected Areas in Communications · 514
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
1992 · Alistair Sinclair · Combinatorics Probability Computing · 498
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
1986 · Éva Tardos · Operations Research · 482
Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations
1996 · Ali Haghani, Sei-Chang Oh · Transportation Research Part A Policy and Practice · 451
The maximum concurrent flow problem
1990 · Farhad Shahrokhi, D. W. Matula · Journal of the ACM · 439
PDF
On the complexity of time table and multi-commodity flow problems
1975 · S. Even, A. Itai, et al. · Annual Symposium on Foundations of Computer Science · 431
The fleet assignment problem: Solving a large-scale integer program
1995 · Christopher A. Hane, Cynthia Barnhart, et al. · Mathematical Programming · 419
Networks synthesis and optimum network design problems: Models, solution methods and applications
1989 · M. Minoux · Networks · 418
Works count: 2,765
Citation count: 63,170
Year
Topic
Type