✦ LIBER ✦

A genetic algorithm for the set covering problem

✍ Scribed by J.E Beasley; P.C Chu

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 939 KB
Volume: 94
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00159-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for set covering problem

✍ J.E. Beasley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 763 KB

Enhancing an algorithm for set covering

Enhancing an algorithm for set covering problems

✍ J.E. Beasley; K. Jørnsten 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 535 KB

A heuristic algorithm for the multi-crit

A heuristic algorithm for the multi-criteria set-covering problems

✍ Yi-Hsin Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Efficient heuristic algorithms for the w

Efficient heuristic algorithms for the weighted set covering problem

✍ Edward K. Baker 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Genetic algorithm-based feature set part

Genetic algorithm-based feature set partitioning for classification problems

✍ Lior Rokach 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a single useful subset of features. This paper presents a novel feature set partitioning approach that is based on a geneti

A generalization of the weighted set cov

A generalization of the weighted set covering problem

✍ Jian Yang; Joseph Y-T. Leung 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,