Flow interception problem with double capacitated service

被引：0
|
作者：
Yang, Jun
Yang, Chao
Ma, Yun-Feng
机构：
来源：
Zhongguo Gonglu Xuebao/China Journal of Highway and Transport | 2004年 / 17卷 / 04期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
No abstract available
引用
收藏
相关论文
共 50 条
  • [41] PRIMAL ALGORITHM FOR SOLVING A CAPACITATED NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR CONSTRAINTS
    CHEN, S
    SAIGAL, R
    NETWORKS, 1977, 7 (01) : 59 - 79
  • [42] Solving a capacitated flow-shop problem with minimizing total energy costs
    Oussama Masmoudi
    Alice Yalaoui
    Yassine Ouazene
    Hicham Chehade
    The International Journal of Advanced Manufacturing Technology, 2017, 90 : 2655 - 2667
  • [43] Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
    Letchford, Adam N.
    Salazar-Gonzalez, Juan-Jose
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (01) : 74 - 84
  • [44] Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem
    Letchford, Adam N.
    Salazar-Gonzalez, Juan-Jose
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (03) : 730 - 738
  • [45] The capacitated centred clustering problem
    Negreiros, M
    Palhano, A
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (06) : 1639 - 1663
  • [46] The Capacitated and Economic Districting Problem
    Pauleti Mendes, Luis Henrique
    Usberti, Fabio Luiz
    Cavellucci, Celso
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (04) : 2003 - 2016
  • [47] On the capacitated vehicle routing problem
    Ralphs, TK
    Kopman, L
    Pulleyblank, WR
    Trotter, LE
    MATHEMATICAL PROGRAMMING, 2003, 94 (2-3) : 343 - 359
  • [48] On the capacitated vehicle routing problem
    T.K. Ralphs
    L. Kopman
    W.R. Pulleyblank
    L.E. Trotter
    Mathematical Programming, 2003, 94 : 343 - 359
  • [49] Capacitated plant location problem
    Sridharan, R.
    European Journal of Operational Research, 1995, 87 (02):
  • [50] COMPLEXITY OF CAPACITATED TREE PROBLEM
    PAPADIMITRIOU, CH
    NETWORKS, 1978, 8 (03) : 217 - 230
12345