✦ LIBER ✦

Analysis of the knapsack problem using L-partition

✍ Scribed by A. A. Kolokolov; E. V. Tsepkova

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of greedy algorithms

✍ Tsung-Chyan Lai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Using stratified sampling to solve the k

✍ N. Yu. Kuznetsov 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 772 KB

A method of solving the knapsack problem

✍ G.P. Veliev; K.Sh. Mamedov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 432 KB

Adjacency of the 0–1 knapsack problem

✍ Daniel Geist; Ervin Y. Rodin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Sensitivity analysis of the knapsack pro

✍ Tarik Belgacem; Mhand Hifi 📂 Article 📅 2008 🏛 SP Systems Engineering Society of China 🌐 English ⚖ 387 KB

Sensitivity analysis of the knapsack pro

✍ Tarik Belgacem; Mhand Hifi 📂 Article 📅 2008 🏛 SP Systems Engineering Society of China 🌐 English ⚖ 256 KB