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 条
  • [21] A computational comparison of flow formulations for the capacitated location-routing problem
    Contardo, Claudio
    Cordeau, Jean-Francois
    Gendron, Bernard
    DISCRETE OPTIMIZATION, 2013, 10 (04) : 263 - 295
  • [22] Capacitated network-flow approach to the evacuation-location problem
    Farahani, Mina Mazraeh
    Chaharsooghi, S. Kamal
    Van Woensel, T.
    Veelenturf, Lucas P.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 115 : 407 - 426
  • [23] Lower and upper bounds for a capacitated plant location problem with multicommodity flow
    Li, Jinfeng
    Chu, Feng
    Prins, Christian
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) : 3019 - 3030
  • [24] Capacitated Clustering Problem
    Levin, M. Sh.
    JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 2024, 69 (1-3) : 118 - 127
  • [25] Capacitated Domination Problem
    Kao, Mong-Jen
    Liao, Chung-Shou
    Lee, D. T.
    ALGORITHMICA, 2011, 60 (02) : 274 - 300
  • [26] Capacitated selection problem
    de Matta, R
    Hsu, VN
    Lowe, TJ
    NAVAL RESEARCH LOGISTICS, 1999, 46 (01) : 19 - 37
  • [27] Capacitated Postman Problem
    Fabry, Jan
    Pelikan, Jan
    MATHEMATICAL METHODS IN ECONOMICS 2013, PTS I AND II, 2013, : 153 - 158
  • [28] Capacitated Domination Problem
    Mong-Jen Kao
    Chung-Shou Liao
    D. T. Lee
    Algorithmica, 2011, 60 : 274 - 300
  • [29] The Probabilistic Minisum Flow Interception Problem: Minimizing the Expected Travel Distance until Intercept under Probabilistic Interception
    Tanaka, Ken-ichi
    Kurita, Osamu
    GEOGRAPHICAL ANALYSIS, 2020, 52 (02) : 211 - 230
  • [30] Model and algorithm of flow interception problem with multi-type of flows
    Hu Dandan
    Journal of Systems Engineering and Electronics, 2009, 20 (04) : 755 - 761
12345