Inverse minimum flow problem

被引:10
|
作者
Ciurea E. [1 ]
Deaconu A. [1 ]
机构
[1] Department of Theoretical Computer Science, Transilvania University, Brasov
关键词
Graph search; Inverse problems; Maximum flow; Minimum cut; Minimum flow; Residual network;
D O I
10.1007/BF02831968
中图分类号
学科分类号
摘要
In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given. © 2007 Korean Society for Computational & Applied Mathematics and Korean SIGCAM.
引用
收藏
页码:193 / 203
页数:10
相关论文
共 50 条
  • [1] Capacity inverse minimum cost flow problem
    Gueler, Cigdem
    Hamacher, Horst W.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 19 (01) : 43 - 59
  • [2] Capacity inverse minimum cost flow problem
    Çiğdem Güler
    Horst W. Hamacher
    Journal of Combinatorial Optimization, 2010, 19 : 43 - 59
  • [3] Inverse Generalized Minimum Cost Flow Problem Under the Hamming Distances
    Karimi, Mobarakeh
    Aman, Massoud
    Dolati, Ardeshir
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 355 - 364
  • [4] Inverse problem of minimum cuts
    Zhang, Jianzhong
    Cai, Mao-cheng
    Mathematical Methods of Operations Research, 47 (01): : 51 - 58
  • [5] Inverse problem of minimum cuts
    Zhang, JZ
    Cai, MC
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1998, 47 (01) : 51 - 58
  • [6] Inverse Generalized Minimum Cost Flow Problem Under the Hamming Distances
    Mobarakeh Karimi
    Massoud Aman
    Ardeshir Dolati
    Journal of the Operations Research Society of China, 2019, 7 : 355 - 364
  • [7] Inverse problem of minimum cuts
    Jianzhong Zhang
    Mao -Cheng Cai
    Mathematical Methods of Operations Research, 1998, 47 : 51 - 58
  • [8] The minimum structure solution to the inverse problem
    Kitanidis, PK
    WATER RESOURCES RESEARCH, 1997, 33 (10) : 2263 - 2272
  • [9] Inverse minimum flow problem under the weighted sum-type Hamming distance
    Liu, Longcheng
    Zheng, Wenhao
    Li, Chao
    DISCRETE APPLIED MATHEMATICS, 2017, 229 : 101 - 112
  • [10] An algorithm for inverse minimum spanning tree problem
    Zhang, JH
    Xu, SJ
    Ma, ZF
    OPTIMIZATION METHODS & SOFTWARE, 1997, 8 (01): : 69 - 84