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 条
12345