Minimum cost time-varying network flow problems

被引：18
|
作者：
Nasrabadi, Ebrahim [1 ]
Hashemi, S. Mehdi [1 ]
机构：
[1] Amirkabir Univ Technol, Dept Comp Sci, Tehran, Iran
来源：
OPTIMIZATION METHODS & SOFTWARE | 2010年 / 25卷 / 03期
关键词：
network flows; time-varying networks; shortest dynamic path; minimum cost dynamic flow; MAXIMAL DYNAMIC FLOWS; SHORTEST-PATH; ALGORITHMS;
D O I：
10.1080/10556780903239121
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
This paper deals with a general minimum cost dynamic flow problem in a discrete time model with time-varying transit times, transit costs, transit capacities, storage costs, and storage capacities. For this problem, an algorithm of time complexity O(V nT(n+T)) is presented, where V is an upper bound on the total supply, n is the number of nodes, and T denotes the given time horizon of the dynamic flow problem. The algorithm is a discrete-time version of the successive shortest path algorithm.
引用
收藏
页码：429 / 447
页数：19
相关论文
共 50 条
  • [41] Algorithms for randomized time-varying knapsack problems
    Yichao He
    Xinlu Zhang
    Wenbin Li
    Xiang Li
    Weili Wu
    Suogang Gao
    Journal of Combinatorial Optimization, 2016, 31 : 95 - 117
  • [42] OPTIMAL SMOOTHING FOR TIME-VARYING COEFFICIENT PROBLEMS
    COOLEY, TF
    ROSENBERG, B
    WALL, KD
    ANNALS OF ECONOMIC AND SOCIAL MEASUREMENT, 1977, 6 (04): : 453 - 456
  • [43] Vehicle scheduling problems with time-varying speed
    Park, YB
    Song, SH
    COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 33 (3-4) : 853 - 856
  • [44] Minimum entropy control for discrete-time time-varying systems
    Peters, MA
    Iglesias, PA
    AUTOMATICA, 1997, 33 (04) : 591 - 605
  • [45] Algorithms for randomized time-varying knapsack problems
    He, Yichao
    Zhang, Xinlu
    Li, Wenbin
    Li, Xiang
    Wu, Weili
    Gao, Suogang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 95 - 117
  • [46] DEFORMABLE, TIME-VARYING BOUNDARY PROBLEMS IN ELECTRODYNAMICS
    Mehler, M. J.
    Constantinou, C. C.
    Neve, M. J.
    PROGRESS IN ELECTROMAGNETICS RESEARCH-PIER, 2012, 123 : 227 - 241
  • [47] A POLYNOMIAL-TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
    MASUZAWA, K
    MIZUNO, S
    MORI, M
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1990, 33 (02) : 157 - 167
  • [48] Streaming Solutions for Time-Varying Optimization Problems
    Hamam, Tomer H.
    Romberg, Justin
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2022, 70 : 3582 - 3597
  • [49] A variational approach for minimum cost flow problems
    Mastroeni, G
    LARGE-SCALE NONLINEAR OPTIMIZATION, 2006, 83 : 211 - 221
  • [50] A neural network approach for the reduction of the dimensionality of slowly time-varying electromagnetic inverse problems
    Morabito, FC
    Coccorese, E
    IEEE TRANSACTIONS ON MAGNETICS, 1996, 32 (03) : 1306 - 1309
12345