✦ LIBER ✦

AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints

✍ Scribed by P. Brucker

Publisher: Springer
Year: 1984
Tongue: English
Weight: 401 KB
Volume: 28
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01919085

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A o(nlogn) algorithm for LP knapsacks wi

A o(nlogn) algorithm for LP knapsacks with GUB constraints

✍ Fred Glover; Darwin Klingman 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 897 KB

A CAT algorithm for generating permutati

A CAT algorithm for generating permutations with a fixed number of inversions

✍ Scott Effler; Frank Ruskey 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.

Low-complexity algorithms for sequencing

Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

✍ Jack A.A. van der Veen; Shuzhong Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 691 KB

A polynomial algorithm for the two machi

A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

✍ Peter Brucker 📂 Article 📅 1994 🏛 Springer 🌐 German ⚖ 289 KB