✦ LIBER ✦

Merging and Sorting Applied to the Zero-One Knapsack Problem

✍ Scribed by J. H. Ahrens and G. Finke

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simulated annealing approach to the mu

✍ A. Drexl 📂 Article 📅 1988 🏛 Springer Vienna 🌐 English ⚖ 372 KB

A heuristic solution procedure for the m

✍ Hasan Pirkul 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 700 KB

A Bound and Bound algorithm for the zero

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

An upper bound for the zero-one knapsack

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

An improved upper bound for the zero-one

✍ Heiner Müller-Merbach 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 166 KB

The Number of Feasible Solutions to a Kn

✍ Achou, O. 📂 Article 📅 1974 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 213 KB