✦ LIBER ✦

A network relaxation based enumeration algorithm for set partitioning

✍ Scribed by Agha Iqbal Ali; Hemalatha Thiagarajan

Book ID: 107992081
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 761 KB
Volume: 38
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(89)90471-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implicit enumeration algorithms for the

Implicit enumeration algorithms for the Set-Partitioning Problem

✍ S. Albers 📂 Article 📅 1980 🏛 Springer 🌐 German ⚖ 797 KB

A Partitioned ∈-Relaxation Algorithm for

A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems

✍ Renato De Leone; Robert R. Meyer; Armand Zakarian 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 96 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 set-partitioning-based exact algorithm

A set-partitioning-based exact algorithm for the vehicle routing problem

✍ Yogesh Agarwal; Kamlesh Mathur; Harvey M. Salkin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 899 KB

A sequential aggregation algorithm for t

A sequential aggregation algorithm for the set partitioning problem

✍ A. Nouh 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 446 KB

An Algorithm for Partitioning a Set into

An Algorithm for Partitioning a Set into Simple Parts

✍ L. Ya. Savel'ev 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 84 KB