✦ LIBER ✦

Implementations of special ordered sets in MP software

✍ Scribed by Wilhelm Hummeltenberg

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 796 KB
Volume: 17
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(84)90002-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

S3 sets. An extension of the Beale-Tomli

S3 sets. An extension of the Beale-Tomlin special ordered sets

✍ L. F. Escudero 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 477 KB

A note of the knapsack problem with spec

A note of the knapsack problem with special ordered sets

✍ Ellis L. Johnson; Manfred W. Padberg 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Symposium on ordered sets : The role of

Symposium on ordered sets : The role of ordered sets in mathematics and its applications

📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Symposium on ordered sets : (The role of

Symposium on ordered sets : (The role of ordered sets in mathematics and its applications)

📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Proportional transitivity in linear exte

Proportional transitivity in linear extensions of ordered sets

✍ P.C Fishburn 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Minimizing bumps in linear extensions of

Minimizing bumps in linear extensions of ordered sets

✍ Peter C. Fishburn; William V. Gehrlein 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 650 KB

A linear extension x,x2xs ... of a partially ordered set (X, <) has a bump whenever xi < xi+l. We examine the problem of determining linear extensions with as few bumps as possible. Heuristic algorithms for approximate bump minimization are considered. AhfS (MOS) subject classifications (1980). Prim