Multiple bottleneck assignment problem

被引：0
|
作者：
Univ of Windsor, Windsor, Canada [1 ]
机构：
来源：
Eur J Oper Res | / 1卷 / 167-173期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
相关论文
共 50 条
  • [21] Uncertain random quadratic bottleneck assignment problem
    Sibo Ding
    Journal of Ambient Intelligence and Humanized Computing, 2020, 11 : 3259 - 3264
  • [22] Bottleneck quadratic assignment problems and the bandwidth problem
    Kellerer, H
    Wirsching, G
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1998, 15 (02) : 169 - 177
  • [23] Uncertain random quadratic bottleneck assignment problem
    Ding, Sibo
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2020, 11 (08) : 3259 - 3264
  • [24] A note on the complexity of the bilevel bottleneck assignment problem
    Dennis Fischer
    Komal Muluk
    Gerhard J. Woeginger
    4OR, 2022, 20 : 713 - 718
  • [25] THE MULTIPLE BOTTLENECK TRANSPORTATION PROBLEM
    WILD, B
    KARWAN, KR
    KARWAN, MH
    COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (03) : 261 - 274
  • [26] ON THE SOLUTION OF A STOCHASTIC BOTTLENECK ASSIGNMENT PROBLEM AND ITS VARIATIONS
    DE, P
    GHOSH, JB
    WELLS, CE
    NAVAL RESEARCH LOGISTICS, 1992, 39 (03) : 389 - 397
  • [27] A turnpike approach to solving the linear bottleneck assignment problem
    Ching-Chung Kuo
    Gillian Nicholls
    The International Journal of Advanced Manufacturing Technology, 2014, 71 : 1059 - 1068
  • [28] A turnpike approach to solving the linear bottleneck assignment problem
    Kuo, Ching-Chung
    Nicholls, Gillian
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 71 (5-8): : 1059 - 1068
  • [29] Task preference-based bottleneck assignment problem
    Ekta Jain
    Kalpana Dahiya
    Anuj Sharma
    Vanita Verma
    Computational and Applied Mathematics, 2022, 41
  • [30] A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem
    Khoo, Mitchell
    Wood, Tony A.
    Manzie, Chris
    Shames, Iman
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (02) : 1210 - 1217
12345