✦ LIBER ✦

A deterministic algorithm for modular knapsack problems

✍ Scribed by Arto Salomaa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimization algorithm for a penalize

✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Approximate algorithms for some generali

✍ Ashok K. Chandra; D.S. Hirschberg; C.K. Wong 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 361 KB

An algorithm for 0-1 multiple-knapsack p

✍ Ming S. Hung; John C. Fisk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

An exact algorithm for large unbounded k

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 391 KB

A minimal algorithm for the multiple-cho

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1017 KB

A hypercube algorithm for the 0/1 Knapsa

✍ Jong Lee; Eugene Shragowitz; Sartaj Sahni 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 878 KB