The Multi-Commodity Flow Problem is a network flow optimization problem in which multiple distinct commodities must be routed simultaneously from their respective origins to destinations through shared network capacities, distinguished by the need to satisfy individual flow conservation and capacity constraints for each commodity.
558
Publications
32.6K
Citations
1.3K
Authors
539
Institutions
Publications per year
2017–2026
103
Parents
Publications
558
On the Complexity of Timetable and Multicommodity Flow Problems
Shimon Even, Alon Itai, Adi Shamir · SIAM Journal on Computing · 1976 · 1.1K citations
Virtual network embedding through topology-aware node ranking
Xiang Cheng, Sen Su, Zhongbao Zhang et al. · ACM SIGCOMM Computer Communication Review · 2011 · 532 citations
1–5 of 558
Authors
1.3K
- TG
12
h-index
- MP
8
h-index
- DN
6
h-index
- JB
6
h-index
- TB
5
h-index
1–5 of 1.3K
Institutions
539
Massachusetts Institute of Technology
Cambridge, United States
25 h-index
52 publications
4.9K citations
Centre National de la Recherche Scientifique
Paris, France
14 h-index
31 publications
1.1K citations
Georgia Institute of Technology
Atlanta, United States
12 h-index
25 publications
672 citations
Université de Montréal
Montreal, Canada
11 h-index
21 publications
1.9K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
14 publications
1.9K citations
University of Southern California
Los Angeles, United States
10 h-index
16 publications
1.3K citations
Université du Québec à Montréal
Montreal, Canada
9 h-index
12 publications
991 citations
Stanford University
Stanford, United States
9 h-index
12 publications
546 citations
1–8 of 539
Venues
- Operations Research
25 publications · 2.7K citations
21
h-index
- Networks
29 publications · 1.4K citations
19
h-index
- European Journal of Operational Research
27 publications · 863 citations
19
h-index
- Management Science
23 publications · 2.2K citations
18
h-index
- Transportation Science
16 publications · 1K citations
15
h-index
1–5