Flows over time in time-varying networks: Optimality conditions and strong duality

被引:6
|
作者
Koch, Ronald [1 ]
Nasrabadi, Ebrahim [2 ]
机构
[1] Tech Univ Berlin, Inst Math, D-10623 Berlin, Germany
[2] MIT, Ctr Operat Res, Cambridge, MA 02139 USA
关键词
Flows over time; Continuous linear programming; Optimality conditions; Duality; PATHS; ALGORITHM;
D O I
10.1016/j.ejor.2014.01.051
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques that are the cornerstones of static network flows. The aim of this paper is to advance the state of the art for dynamic network flows by developing the continuous time analogues of the theory for static network flows. Specifically, we make use of ideas from the static case to establish a reduced cost optimality condition, a negative cycle optimality condition, and a strong duality result for a very general class of network flows over time. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:580 / 589
页数:10
相关论文
共 50 条