THE BOTTLENECK GENERALIZED ASSIGNMENT PROBLEM

被引:32
|
作者
MARTELLO, S
TOTH, P
机构
[1] UNIV TURIN, DIPARTIMENTO INFORMAT, I-10124 TURIN, ITALY
[2] UNIV BOLOGNA, DEIS, I-40126 BOLOGNA, ITALY
关键词
ASSIGNMENT; RELAXATION; HEURISTICS; BRANCH-AND-BOUND;
D O I
10.1016/0377-2217(93)E0271-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The min-max version of the generalized assignment problem is considered. We introduce relaxations and show that they produce, as sub-problems, min-max versions of the multiple-choice knapsack problem and of the 0-1 knapsack problem. It is proved that such problems can be solved exactly in polynomial time. We also introduce approximate algorithms and an exact branch-and-bound produce. Randomly generated test problems involving up to 50000 binary variables are solved exactly in acceptable running times.
引用
收藏
页码:621 / 638
页数:18
相关论文
共 50 条
  • [21] General bottleneck assignment problem and its algorithm
    Zhu, Xiao-Xia
    Wang, Rui-Jiang
    Du, Gang-Po
    [J]. PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 2572 - +
  • [22] Formulation and Solution of the Probabilistic Bottleneck Assignment Problem
    Kuo, Ching-Chung
    [J]. ICOSCM 2009 - PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON OPERATIONS AND SUPPLY CHAIN MANAGEMENT, 2009, 3 : 430 - 431
  • [23] A New Method to Solve the Bottleneck Assignment Problem
    Cai, Xuewei
    Shi, Haobin
    Hwang, Kao-Shing
    Wang, Shixiong
    Chen, Huahui
    Li, Xuesi
    Cui, Hongwei
    [J]. 2016 INTERNATIONAL SYMPOSIUM ON COMPUTER, CONSUMER AND CONTROL (IS3C), 2016, : 471 - 474
  • [24] Distributed Algorithm for Solving the Bottleneck Assignment Problem
    Khoo, Mitchell
    Wood, Tony A.
    Manzie, Chris
    Shames, Iman
    [J]. 2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 1850 - 1855
  • [25] A note on the complexity of the bilevel bottleneck assignment problem
    Dennis Fischer
    Komal Muluk
    Gerhard J. Woeginger
    [J]. 4OR, 2022, 20 : 713 - 718
  • [26] Uncertain random quadratic bottleneck assignment problem
    Ding, Sibo
    [J]. JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2020, 11 (08) : 3259 - 3264
  • [27] Bottleneck quadratic assignment problems and the bandwidth problem
    Kellerer, H
    Wirsching, G
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1998, 15 (02) : 169 - 177
  • [28] Uncertain random quadratic bottleneck assignment problem
    Sibo Ding
    [J]. Journal of Ambient Intelligence and Humanized Computing, 2020, 11 : 3259 - 3264
  • [29] A bottleneck assignment approach to the multiple container loading problem
    Michael Eley
    [J]. OR Spectrum, 2003, 25 (1) : 45 - 60
  • [30] ON THE SOLUTION OF A STOCHASTIC BOTTLENECK ASSIGNMENT PROBLEM AND ITS VARIATIONS
    DE, P
    GHOSH, JB
    WELLS, CE
    [J]. NAVAL RESEARCH LOGISTICS, 1992, 39 (03) : 389 - 397