𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New results from an algorithm for counting posets

✍ Scribed by Joseph C. Culberson; Gregory J. E. Rawlins

Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
805 KB
Volume
7
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we report on the success of a new technique for computing the number of unlabeled partial orders on n elements based on the partial order of partial orders ordered by containment. In addition to the number of partial orders, we obtain complete enumerations of the number of partial orders on n elements with r relations for n < 11, where r takes on all possible values. We point out some interesting sequences that arise in these tables.

πŸ“œ SIMILAR VOLUMES

Pushdown–reduce: an algorithm for connec
Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems
✍ AndrΓ‘s A. BenczΓΊr πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 557 KB

In their seminal paper, Frank and Jordà an show that a large class of optimization problems including certain directed edge augmentation ones fall into the class of covering supermodular functions over pairs of sets. They also give an algorithm for such problems, however, that relies on the ellipsoi

An improved hybrid genetic algorithm: ne
An improved hybrid genetic algorithm: new results for the quadratic assignment problem
✍ Alfonsas Misevicius πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 229 KB

In this paper, we propose an improved hybrid genetic algorithm (IHGA). It uses a robust local improvement procedure as well as an effective restart mechanism that is based on so-called 'shift mutations'. IHGA has been applied to the well-known combinatorial optimization problem, the quadratic assign