Algorithms for the set covering problem

被引：244

作者：

Caprara, A

Toth, P

Fischetti, M

机构：

[1] Univ Bologna, DEIS, I-40136 Bologna, Italy

[2] Univ Padua, DEI, I-35131 Padua, Italy

来源：

ANNALS OF OPERATIONS RESEARCH | 2000年 / 98卷 / 1-4期

关键词：

D O I：

10.1023/A:1019225027893

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and mass-transit companies. In this survey, we focus our attention on the most recent and effective algorithms fur SCP, considering both heuristic and exact approaches, outlining their main characteristics and presenting an experimental comparison on the test-bed instances of Beasley's OR Library.

引用

页码：353 / 371

页数：19

共 27 条

[1] A genetic algorithm for the set covering problem [J].