✦ LIBER ✦

Solving the 0–1 proportional knapsack problem by sampling

✍ Scribed by M. Penn; D. Hasson; M. Avriel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using stratified sampling to solve the k

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

The Collapsing 0–1 Knapsack Problem

✍ Marc E. Posner; Monique Guignard 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 303 KB

On the Dietrich-Escudero approach for so

✍ L.F. Escudero; G. Pérez; A. Garin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Testable heuristics for the 0–1 knapsack

✍ Bruno Apolloni 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 866 KB

An algorithm for the 0/1 Knapsack proble

✍ Marion Lauriere 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 375 KB

Linear programming for the 0–1 quadratic

✍ Alain Billionnet; Frédéric Calmels 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 852 KB