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 条
  • [21] Minimum-cost optimization in multicommodity logistic chain network
    Li, HX
    Tian, SC
    Pan, Y
    Zhang, X
    Yu, XC
    COMPUTER ALGEBRA AND GEOMETRIC ALGEBRA WITH APPLICATIONS, 2005, 3519 : 97 - 104
  • [22] Approximate minimum-cost multicommodity flows in (O)over-tilde (epsilon(-2)KNM) time
    Grigoriadis, MD
    Khachiyan, LG
    MATHEMATICAL PROGRAMMING, 1996, 75 (03) : 477 - 482
  • [23] MINIMUM-COST FLOWS IN CONVEX-COST NETWORKS
    HU, TC
    NAVAL RESEARCH LOGISTICS QUARTERLY, 1966, 13 (01): : 1 - &
  • [24] NOTE ON MINIMUM COST CONVEX FLOWS
    ADOLPHSON, DL
    NAVAL RESEARCH LOGISTICS, 1976, 23 (04) : 713 - 714
  • [25] Minimum concave cost flow over a grid network
    Qie He
    Shabbir Ahmed
    George L. Nemhauser
    Mathematical Programming, 2015, 150 : 79 - 98
  • [26] Minimum concave cost flow over a grid network
    He, Qie
    Ahmed, Shabbir
    Nemhauser, George L.
    MATHEMATICAL PROGRAMMING, 2015, 150 (01) : 79 - 98
  • [27] OPTIMAL ASSORTMENT WITH CONCAVE COST-FUNCTIONS
    FANG, SC
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1985, 16 (10) : 1305 - 1311
  • [28] Strategyproof Facility Location for Concave Cost Functions
    Dimitris Fotakis
    Christos Tzamos
    Algorithmica, 2016, 76 : 143 - 167
  • [29] Strategyproof Facility Location for Concave Cost Functions
    Fotakis, Dimitris
    Tzamos, Christos
    ALGORITHMICA, 2016, 76 (01) : 143 - 167
  • [30] An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow
    Goldberg, AV
    Oldham, JD
    Plotkin, S
    Stein, C
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 338 - 352
12345