A LAGRANGIAN HEURISTIC FOR SET-COVERING PROBLEMS

被引：0
|
作者：
BEASLEY, JE
机构：
[1] Management School, Imperial College, London
来源：
NAVAL RESEARCH LOGISTICS | 1990年 / 37卷 / 01期
关键词：
D O I：
10.1002/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this article we present a heuristic algorithm for non‐unicost set‐covering problems based upon Lagrangian relaxation and subgradient optimization. Computational results, based upon problems involving up to 1000 rows and 10000 columns, indicate that this heuristic produces better‐quality results than a number of other heuristics. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码：151 / 164
页数：14
相关论文
共 50 条
  • [41] Incremental development of diagnostic set-covering models with therapy effects
    Baumeister, J
    Seipel, D
    Puppe, F
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2003, 11 : 25 - 49
  • [42] THE WORST AND THE MOST PROBABLE PERFORMANCE OF A CLASS OF SET-COVERING ALGORITHMS
    LIFSCHITZ, V
    PITTEL, B
    SIAM JOURNAL ON COMPUTING, 1983, 12 (02) : 329 - 346
  • [43] CUTTING-PLANE ALGORITHM FOR QUADRATIC SET-COVERING PROBLEM
    BAZARAA, MS
    GOODE, JJ
    OPERATIONS RESEARCH, 1975, 23 (01) : 150 - 158
  • [44] SCE: A Manifold Regularized Set-Covering Method for Data Partitioning
    Li, Xuelong
    Lu, Quanmao
    Dong, Yongsheng
    Tao, Dacheng
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (05) : 1760 - 1773
  • [45] Survey of 8 UAV Set-Covering Algorithms for Terrain Photogrammetry
    Hammond, Joshua E.
    Vernon, Cory A.
    Okeson, Trent J.
    Barrett, Benjamin J.
    Arce, Samuel
    Newell, Valerie
    Janson, Joseph
    Franke, Kevin W.
    Hedengren, John D.
    REMOTE SENSING, 2020, 12 (14)
  • [46] A Cost-Based Set-Covering Location-Allocation Problem with Unknown Covering Radius
    Bashiri, Mahdi
    Fotuhi, Fateme
    2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 1979 - 1983
  • [47] Hybrid heuristic algorithms for set covering
    Monfroglio, A
    COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (06) : 441 - 455
  • [48] A hybrid heuristic for the set covering problem
    Shyam Sundar
    Alok Singh
    Operational Research, 2012, 12 : 345 - 365
  • [49] A heuristic method for the set covering problem
    Caprara, A
    Fischetti, M
    Toth, P
    OPERATIONS RESEARCH, 1999, 47 (05) : 730 - 743
  • [50] A hybrid heuristic for the set covering problem
    Sundar, Shyam
    Singh, Alok
    OPERATIONAL RESEARCH, 2012, 12 (03) : 345 - 365
12345