BOOK-CHAPTER
The Quickest Multicommodity Flow Problem
Year: 2002 Lecture notes in computer science Pages: 36-53 Publisher: Springer Science+Business Media
Keywords:
Discretization Multi-commodity flow problem Time complexity Computer science Polynomial Flow network Mathematical optimization Polynomial-time approximation scheme Flow (mathematics) Degree of a polynomial Algorithm Computational complexity theory Mathematics Applied mathematics
Metrics
80
Cited By
6.64
FWCI (Field Weighted Citation Impact)
20
Refs
0.97
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Optimization and Search Problems
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem
Anna MelchioriAntonino Sgalambro
Journal: Computers & Operations Research Year: 2017 Vol: 92 Pages: 111-129
JOURNAL ARTICLE
Multicommodity flow problem
Journal: Journal of Mathematical Sciences Year: 1993 Vol: 65 (1)Pages: 1462-1464
JOURNAL ARTICLE
A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem
Anna MelchioriAntonino Sgalambro
Journal: European Journal of Operational Research Year: 2019 Vol: 282 (3)Pages: 846-857
JOURNAL ARTICLE
The quickest flow problem
Rainer E. BurkardK. DlaskaBettina Klinz
Journal: Mathematical Methods of Operations Research Year: 1993 Vol: 37 (1)Pages: 31-58