On the Quickest Flow Problem in Dynamic Networks - a Parametric Min-Cost Flow Approach

On the Quickest Flow Problem in Dynamic Networks - a Parametric Min-Cost Flow Approach

We consider the quickest flow problem in dynamic networks with a single source s and a single sink t: given an amount of flow F, find the minimum time needed to send it from s to t, and the corresponding optimal flow over time. We introduce new mathematical formulations and derive optimality conditi...

Full description

Bibliographic Details
Main Authors: Lin, Maokai (Contributor), Jaillet, Patrick (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Operations Research Center (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2015-12-19T02:05:29Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items