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 条
  • [31] On the minimum-cost set-covering problem
    Chiang, CC
    Dai, HK
    PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3, 2005, : 1199 - 1205
  • [32] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING
    BALAS, E
    PADBERG, M
    OPERATIONS RESEARCH, 1975, 23 (01) : 74 - 90
  • [33] Comparing set-covering strategies for optimal corpus design
    Chevelu, Jonathan
    Barbot, Nelly
    Boeffard, Olivier
    Delhay, Arnaud
    SIXTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, LREC 2008, 2008, : 2951 - 2956
  • [34] SET-COVERING PROBLEM - NEW IMPLICIT ENUMERATION ALGORITHM
    ETCHEBERRY, J
    OPERATIONS RESEARCH, 1977, 25 (05) : 760 - 772
  • [35] A Set-Covering Approach with Column Generation for Parsimony Haplotyping
    Lancia, Giuseppe
    Serafini, Paolo
    INFORMS JOURNAL ON COMPUTING, 2009, 21 (01) : 151 - 166
  • [36] A parallel genetic algorithm to solve the set-covering problem
    Solar, M
    Parada, V
    Urrutia, R
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (09) : 1221 - 1235
  • [37] Harmony Search Algorithm for Solving Set-Covering Problem
    Salas, Juan
    Crawford, Broderick
    Soto, Ricardo
    Gomez Rubio, Alvaro
    Jaramillo, Adrian
    Mansilla Villablanca, Sebastian
    Olguin, Eduardo
    TRENDS IN APPLIED KNOWLEDGE-BASED SYSTEMS AND DATA SCIENCE, 2016, 9799 : 917 - 930
  • [38] FRACTIONS IN THE LOCATION SET-COVERING PROBLEM - A BRIEF NOTE
    PASTOR, JT
    ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, 1993, 20 (04): : 479 - 480
  • [39] ON THE SET-COVERING PROBLEM - 2. AN ALGORITHM FOR SET PARTITIONING.
    Balas, Egon
    Padberg, Manfred
    Operations Research, 1600, 1 (74-90):
  • [40] A multidimensional fitness function based heuristic algorithm for set covering problems
    Hashemi, Ahmad
    Gholami, Hamed
    Delorme, Xavier
    Wong, Kuan Yew
    APPLIED SOFT COMPUTING, 2025, 174
12345