Parallel algorithms for solving the convex minimum cost flow problem

被引：5
|
作者：
Beraldi, P [1 ]
Guerriero, F
Musmanno, R
机构：
[1] Univ Calabria, Dipartimento Elettr Informat & Sistemist, I-87036 Rende, CS, Italy
[2] Univ Lecce, Fac Ingn, I-73100 Lecce, Italy
来源：
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2001年 / 18卷 / 02期
关键词：
convex minimum cost flow problem; epsilon-relaxation method; shared memory multiprocessor; asynchronous parallel algorithms; speedup;
D O I：
10.1023/A:1008778622003
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel asynchronous version of the epsilon -relaxation method and we prove theoretically its correctness. We present two implementations of the parallel method for a shared memory multiprocessor system, and we empirically analyze their numerical performance on different test problems. The preliminary numerical results show a good reduction of the execution time of the parallel algorithm with the respect to the sequential counterpart.
引用
收藏
页码：175 / 190
页数：16
相关论文
共 50 条
  • [1] Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem
    P. Beraldi
    F. Guerriero
    R. Musmanno
    [J]. Computational Optimization and Applications, 2001, 18 : 175 - 190
  • [2] Efficient Parallel Algorithms for the Minimum Cost Flow Problem
    P. Beraldi
    F. Guerriero
    R. Musmanno
    [J]. Journal of Optimization Theory and Applications, 1997, 95 : 501 - 530
  • [3] Efficient parallel algorithms for the minimum cost flow problem
    Beraldi, P
    Guerriero, F
    Musmanno, R
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1997, 95 (03) : 501 - 530
  • [4] Minimum convex cost flow problem
    Nguyen, VA
    Tan, YP
    [J]. ICICS-PCM 2003, VOLS 1-3, PROCEEDINGS, 2003, : 1248 - 1252
  • [5] Combinatorial algorithms for the minimum interval cost flow problem
    Hashemi, S. Medhi
    Ghatee, Mehdi
    Nasrabadi, Ebrahim
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (02) : 1200 - 1216
  • [6] Solving the convex cost integer dual network flow problem
    Ahuja, RK
    Hochbaum, DS
    Orlin, JB
    [J]. MANAGEMENT SCIENCE, 2003, 49 (07) : 950 - 964
  • [7] Solving the convex cost integer dual network flow problem
    Ahuja, RK
    Hochbaum, DS
    Orlin, JB
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 31 - 44
  • [8] PARALLEL ALGORITHMS FOR THE ASSIGNMENT AND MINIMUM-COST FLOW PROBLEMS
    ORLIN, JB
    STEIN, C
    [J]. OPERATIONS RESEARCH LETTERS, 1993, 14 (04) : 181 - 186
  • [9] MINIMUM COST FLOW ALGORITHMS FOR SERIES-PARALLEL NETWORKS
    BEIN, WW
    BRUCKER, P
    TAMIR, A
    [J]. DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) : 117 - 124
  • [10] EFFICIENT SEQUENTIAL AND PARALLEL ALGORITHMS FOR PLANAR MINIMUM COST FLOW
    IMAI, H
    IWANO, K
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 21 - 30
12345