Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem

被引：0
|
作者：
Park, June S. [1 ]
Lim, Byung Ha [1 ]
Lee, Youngho [1 ]
机构：
[1] Univ of Iowa, Iowa City, United States
来源：
Management Science | 1998年 / 44卷 / 12 pt 2期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] A Branch-and-Bound Algorithm for the Talent Scheduling Problem
    Liang, Xiaocong
    Zhang, Zizhen
    Qin, Hu
    Guo, Songshan
    Lim, Andrew
    MODERN ADVANCES IN APPLIED INTELLIGENCE, IEA/AIE 2014, PT I, 2014, 8481 : 208 - 217
  • [22] A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
    Holmberg, K
    Yuan, D
    OPERATIONS RESEARCH, 2000, 48 (03) : 461 - 481
  • [23] An enhanced branch-and-bound algorithm for a partitioning problem
    Brusco, MJ
    BRITISH JOURNAL OF MATHEMATICAL & STATISTICAL PSYCHOLOGY, 2003, 56 : 83 - 92
  • [24] A branch-and-bound algorithm for the coupled task problem
    József Békési
    Gábor Galambos
    Michael N. Jung
    Marcus Oswald
    Gerhard Reinelt
    Mathematical Methods of Operations Research, 2014, 80 : 47 - 81
  • [25] EXACT BRANCH-AND-BOUND PROCEDURE FOR THE QUADRATIC-ASSIGNMENT PROBLEM
    BAZARAA, MS
    ELSHAFEI, AN
    NAVAL RESEARCH LOGISTICS, 1979, 26 (01) : 109 - 121
  • [26] An accelerated Branch-and-Bound algorithm for assignment problems of utility systems
    Strouvalis, AM
    Heckl, I
    Friedler, F
    Kokossis, AC
    COMPUTERS & CHEMICAL ENGINEERING, 2002, 26 (4-5) : 617 - 630
  • [27] A BRANCH-AND-BOUND ALGORITHM FOR THE MULTI-LEVEL UNCAPACITATED FACILITY LOCATION PROBLEM
    TCHA, DW
    LEE, BI
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 18 (01) : 35 - 43
  • [28] An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
    Li, Chu-Min
    Quan, Zhe
    PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 128 - 133
  • [29] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
    A. N. Maksimenko
    Automatic Control and Computer Sciences, 2021, 55 : 816 - 826
  • [30] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
    Maksimenko, A. N.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2021, 55 (07) : 816 - 826
12345