Note—A Computational Survey of Methods for the Set Covering Problem
نویسندگان
چکیده
منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملa local branching approach for the set covering problem
the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...
متن کاملAlgorithms for the Set Covering Problem
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 e ective algo rithms for SCP considering both heuristic and exact approaches outlining their main characteristics and presenting an experimental comparison on the test bed instances of Beasley...
متن کامل2 Set Covering Problem
In the previous lecture, we covered a series of online/offline edge-weighted Steiner tree/forest problems. This lecture extends the discussion to the node-weighted scope. In particular, we will study the nodeweighted Steiner tree/forest problem and introduce an offline O(logn)−approximation polynomial-time algorithm[KR95]. It is well known there is no polynormial-time algorithm that achieves o(...
متن کاملGlobal Constraint for the Set Covering Problem
souci d'allier la proposition d'idées originales, qui ressortent du cadre de l'application simple, et de la concrétisation fiable de cesdernì eres. Y arriver est une chose d'extrêmement gratifiante. Leséchanges que nous avons eu m'ont toujours beaucoup apportés.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1975
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.21.5.591