The Quickest Multicommodity Flow Problem

This publication has 17 references indexed in Scilit:

• The Quickest Transshipment Problem
  Mathematics of Operations Research, 2000
• Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
  SIAM Journal on Discrete Mathematics, 2000
• Efficient continuous-time dynamic network flow algorithms
  Operations Research Letters, 1998
• The quickest flow problem
  Mathematical Methods of Operations Research, 1993
• Approximation Schemes for the Restricted Shortest Path Problem
  Mathematics of Operations Research, 1992
• A survey of dynamic network flows
  Annals of Operations Research, 1989
• Geometric Algorithms and Combinatorial Optimization
  Published by Springer Nature ,1988
• A dual algorithm for the constrained shortest path problem
  Networks, 1980
• Transient flows in networks.
  The Michigan Mathematical Journal, 1959
• Constructing Maximal Dynamic Flows from Static Flows
  Operations Research, 1958