MINIMUM COST MULTICOMMODITY FLOWS WITH CONCAVE COST FUNCTIONS

被引：0
|
作者：
MINOUX, M [1 ]
机构：
[1] CTR NATL ETUD TELECOMMUN,DEPT ETUD & COMMUTATION & RESEAUX,RESEAUX & CTR COMMUTATION GRP,F-92131 ISSY LES MOULINEA,FRANCE
来源：
ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS | 1976年 / 31卷 / 3-4期
关键词：
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
引用
收藏
页码：77 / 92
页数：16
相关论文
共 50 条
  • [1] Minimum concave cost multicommodity network design
    Bazlamacci, Cueneyt F.
    Say, Fatih
    [J]. TELECOMMUNICATION SYSTEMS, 2007, 36 (04) : 181 - 203
  • [2] Minimum concave cost multicommodity network design
    Cüneyt F. Bazlamaçcı
    Fatih Say
    [J]. Telecommunication Systems, 2007, 36 : 181 - 203
  • [3] MINIMUM-COST MULTICOMMODITY NETWORK FLOWS
    TOMLIN, JA
    [J]. OPERATIONS RESEARCH, 1966, 14 (01) : 45 - &
  • [4] Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks
    Ward, JA
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (01) : 106 - 129
  • [5] Minimum cost capacity installation for multicommodity network flows
    Daniel Bienstock
    Sunil Chopra
    Oktay Günlük
    Chih-Yang Tsai
    [J]. Mathematical Programming, 1998, 81 : 177 - 199
  • [6] Minimum cost capacity installation for multicommodity network flows
    Bienstock, D
    Chopra, S
    Gunluk, O
    Tsai, CY
    [J]. MATHEMATICAL PROGRAMMING, 1998, 81 (02) : 177 - 199
  • [7] MINIMUM CONCAVE COST FLOWS IN CERTAIN NETWORKS
    ZANGWILL, WI
    [J]. MANAGEMENT SCIENCE, 1968, 14 (07) : 429 - 450
  • [8] A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
    Shepherd, B
    Zhang, L
    [J]. GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 1535 - 1543
  • [9] A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
    Shepherd, B
    Zhang, L
    [J]. DISCRETE APPLIED MATHEMATICS, 2001, 110 (2-3) : 301 - 315
  • [10] Uncertain minimum cost multicommodity flow problem
    Sibo Ding
    [J]. Soft Computing, 2017, 21 : 223 - 231
12345