✦ LIBER ✦

A well-solvable special case of the bounded knapsack problem

✍ Scribed by Vladimir G. Deineko; Gerhard J. Woeginger

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 196 KB
Volume: 39
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2011.01.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A solvable case of the variance minimiza

A solvable case of the variance minimization problem

✍ X. Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 326 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

A special case of the 3 × n flow shop pr

A special case of the 3 × n flow shop problem

✍ Fennell Burns; John Rooker 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the cor

A lower bound of 12n2 on linear search p

A lower bound of 12n2 on linear search programs for the Knapsack problem

✍ David Dobkin; Richard J. Lipton 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 234 KB

A special case of the dynamization probl

A special case of the dynamization problem for least cost paths

✍ Davide Crippa 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Resolvent of the problem of the minimum

Resolvent of the problem of the minimum of a quadratic functional in a special case

✍ M.K. Likht 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 184 KB