✦ LIBER ✦

Tighter representations for set partitioning problems

✍ Scribed by Hanif D. Sherali; Youngho Lee

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 1000 KB
Volume: 68
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00060-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Graph theoretic relaxations of set cover

Graph theoretic relaxations of set covering and set partitioning problems

✍ Elia El-Darzi; Gautam Mitra 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Tighter relaxations for the cutting stoc

Tighter relaxations for the cutting stock problem

✍ Christoph Nitsche; Guntram Scheithauer; Johannes Terno 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 134 KB

In the cutting stock problem (CSP) a given order for smaller pieces has to be cut from larger stock material in such a way that the number of stock material needed is minimal. Based on the classical integer linear programming model the common solution technique consists of solving the corresponding

Applying evolutionary programming to sel

Applying evolutionary programming to selected set partitioning problems

✍ Paul Gomme; Paul G. Harrald 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Evolutionary programming is applied to several instances of the set partitioning problem. Comparison is made between the distribution of best-evolved solutions arising from implementations of the EP with the empirical distribution of a randomly selected trial solution.

Sorting and doubling techniques for set

Sorting and doubling techniques for set partitioning and automata minimization problems

✍ D. Ziadi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 118 KB

In this paper we present an O(n 2 ) implementation of Moore's algorithm for automata minimization. It is based on an optimal sorting procedure and on basic data structures. We also deepen the link between set partitioning problem and automata minimization problem, and assess the applicability of the

A set partitioning heuristic for the gen

A set partitioning heuristic for the generalized assignment problem

✍ Dirk.G. Cattrysse; Marc Salomon; Luk N. Van Wassenhove 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 530 KB