✦ LIBER ✦

Algorithm 632; a program for the 0--1 multiple knapsack problem

✍ Scribed by Martello, Silvano; Toth, Paolo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for 0-1 multiple-knapsack p

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

A hypercube algorithm for the 0/1 Knapsa

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

A parallel algorithm for the 0–1 knapsac

✍ W. Loots; T. H. C. Smith 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 626 KB

An algorithm for the 0/1 Knapsack proble

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

Dynamic programming based algorithms for

✍ Aiying Rong; José Rui Figueira; Kathrin Klamroth 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Approximate Algorithms for the 0/1 Knaps

✍ Sahni, Sartaj 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 628 KB