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 condit...

Full description

Bibliographic Details
Main Authors:	Lin, Maokai, Jaillet, Patrick
Other Authors:	Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format:	Article
Language:	en_US
Published:	Society for Industrial and Applied Mathematics 2015
Online Access:	http://hdl.handle.net/1721.1/100441 https://orcid.org/0000-0002-8585-6566

Similar Items

Quickest Multistate Flow Networks With the Deterioration Effect
by: Min-Fan He, et al.
Published: (2020-01-01)

Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints
by: Majid Forghani-elahabad, et al.
Published: (2023-12-01)

Network security and min-cost max-flow problem
by: Dahan, Mathieu
Published: (2016)

Quickest detection /
by: 182634 Poor, H. Vincent, et al.
Published: (2009)

Application of the quickest path approach to route selection /
by: Ahmad Hilmy Abdul Hamid, 1959-, et al.
Published: (1986)

Quickest way to draw well /
by: 340025 Taubes, Frederic
Published: (1977)

Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
by: Gamarnik, David, et al.
Published: (2012)

Belief Propagation for Min-Cost Network Flow: Convergence & Correctness
by: Gamarnik, David, et al.
Published: (2012)

Optimal road matching by relaxation to min-cost network flow
by: Hangbin Wu, et al.
Published: (2022-11-01)

Asymptotically optimal sampling policy for quickest change detection with observation-switching cost
by: Lau, Tze Siong, et al.
Published: (2021)

SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
by: Rolly Intan
Published: (2005-01-01)

A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
Published: (2003)

Shortest path to a segment and quickest visibility queries
by: Valentin Polishchuk, et al.
Published: (2016-01-01)

Quickest change detection in the presence of a nuisance change
by: Lau, Tze Siong, et al.
Published: (2021)

Quickest change detection under a nuisance change
by: Lau, Tze Siong, et al.
Published: (2020)

A binning approach to quickest change detection with unknown post-change distribution
by: Lau, Tze Siong, et al.
Published: (2020)

Millionaire by thirty : the quickest path to early financial independence /
by: Andrew, Douglas R, et al.
Published: (2008)

In search of the quickest way to disseminate health care innovations
by: Guus Schrijvers, et al.
Published: (2003-10-01)

In search of the quickest way to disseminate health care innovations
by: Guus Schrijvers, et al.
Published: (2003-10-01)

Quickest change detection approach to optimal control in Markov decision processes with model changes
by: Banerjee, Taposh, et al.
Published: (2018)

Parametric ekelands variational principle and applications for min-max problems /
by: 351103 Georgiev, Pando Gr, et al.
Published: (1995)

An iterative security game for computing robust and adaptive network flows
by: Ghosh, Supriyo, et al.
Published: (2022)

On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2005)

A case study in robust quickest detection for hidden Markov models
by: Atwi, Aliaa
Published: (2011)

ON NETWORK FLOW PROBLEMS WITH CONVEX COST
by: V. A. Nguyen, et al.
Published: (2004-05-01)

On network flow problems with convex cost
by: Nguyen, V.A., et al.
Published: (2004)

Network modelling and computation of quickest path for service-level agreements using bi-objective optimization
by: Ashutosh Sharma, et al.
Published: (2019-10-01)

Operationally constrained quickest change detection with multiple post-change distributions
by: Lau, Tze Siong
Published: (2020)

Wasserstein model reduction approach for parametrized flow problems in porous media
by: Battisti Beatrice, et al.
Published: (2023-01-01)

What's "quickest and easiest?": parental decision making about school trip mode
by: Faulkner Guy EJ, et al.
Published: (2010-08-01)

Restless Watchdog: Selective Quickest Spectrum Sensing in Multichannel Cognitive Radio Systems
by: Husheng Li
Published: (2009-01-01)

Quickest attack detection in smart grid based on sequential Monte Carlo filtering
by: Leian Chen, et al.
Published: (2020-05-01)

Publisher Correction: Decision support for the quickest detection of critical COVID-19 phases
by: Paolo Braca, et al.
Published: (2021-07-01)

New distance-directed algorithms for maximum flow and parametric maximum flow problems
Published: (2003)

The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
by: Maria A. Fonoberova, et al.
Published: (2005-05-01)

Optimization and equilibrium in dynamic networks and applications in traffic systems
by: Lin, Maokai
Published: (2015)

Online Multiple Object Tracking Using Min-Cost Flow on Temporal Window for Autonomous Driving
by: Hongjian Wei, et al.
Published: (2023-09-01)

The auction algorithm for the minimum cost network flow problem
Published: (2003)

Relaxation methods for minimum cost network flow problems
Published: (2002)

Minimum cost network flows: Problems, algorithms, and software
by: Sifaleras Angelo
Published: (2013-01-01)