Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs

被引：0
|
作者：
Ghiyasvand, Mehdi [1 ]
机构：
[1] Bu Ali Sina Univ, Dept Math, Fac Sci, Hamadan, Iran
来源：
ANNALS OF OPERATIONS RESEARCH | 2015年 / 229卷 / 01期
关键词：
Network flows; The parametric bipartite maximum flow problem; Closure graphs; Unbalanced bipartite graphs; Gallo et al's parametric maximum flow algorithm; SHOP SCHEDULING PROBLEMS; NETWORK FLOW; TIME-WINDOWS; ALGORITHMS;
D O I：
10.1007/s10479-015-1807-7
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Given a directed bipartite graph with a node set , and an arc set , where , , and . Chen (1995) presented an time algorithm to solve the parametric bipartite maximum flow problem. In this paper, we assume all arcs in have infinite capacity [such a graph is called closure graph Hochbaum (1998)], and present a new approach to solve the problem, which runs in time using Gallo et al's parametric maximum flow algorithm, see Gallo et al. (1989). In unbalanced bipartite graphs, we have , so, our algorithm improves Chens's algorithm in unbalanced and closure bipartite graphs.
引用
下载
收藏
页码：397 / 408
页数：12
相关论文
共 50 条
  • [1] Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
    Mehdi Ghiyasvand
    Annals of Operations Research, 2015, 229 : 397 - 408
  • [2] Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
    Acuna, V.
    Ferreira, C. E.
    Freire, A. S.
    Moreno, E.
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 2 - 12
  • [3] A PARAMETRIC MAXIMUM FLOW ALGORITHM FOR BIPARTITE GRAPHS WITH APPLICATIONS
    CHEN, YL
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 80 (01) : 226 - 235
  • [4] Unbalanced bipartite factorizations of complete bipartite graphs
    Martin, Nigel
    DISCRETE MATHEMATICS, 2006, 306 (17) : 2084 - 2090
  • [5] The maximum vertex coverage problem on bipartite graphs
    Apollonio, Nicola
    Simeone, Bruno
    DISCRETE APPLIED MATHEMATICS, 2014, 165 : 37 - 48
  • [6] MAXIMUM SEMI-MATCHING PROBLEM IN BIPARTITE GRAPHS
    Katrenic, Jan
    Semanisin, Gabriel
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (03) : 559 - 569
  • [7] PROBLEM ON BIPARTITE GRAPHS
    VANLINT, JH
    AMERICAN MATHEMATICAL MONTHLY, 1975, 82 (01): : 55 - 56
  • [8] Long cycles in unbalanced bipartite graphs
    Chiba, Shuya
    Fujisawa, Jun
    Tsugaki, Masao
    Yamashita, Tomoki
    DISCRETE MATHEMATICS, 2012, 312 (11) : 1857 - 1862
  • [9] Bounds on maximum concurrent flow in random bipartite graphs
    Fernando E. Vilas
    Eli V. Olinick
    David W. Matula
    Optimization Letters, 2020, 14 : 2197 - 2209
  • [10] Bounds on maximum concurrent flow in random bipartite graphs
    Vilas, Fernando E.
    Olinick, Eli V.
    Matula, David W.
    OPTIMIZATION LETTERS, 2020, 14 (08) : 2197 - 2209
12345