✦ LIBER ✦

Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems

✍ Scribed by N. N. Galimyanova

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid dynamic programming/branch-and-

✍ M.E. Dyer; W.O. Riha; J. Walker 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 742 KB

Application of the branch and bound meth

✍ I.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 464 KB

Combined branch-and-bound and cutting pl

✍ LÊ D. Muu; W. Oettli 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 701 KB

On the convergence of two branch-and-bou

✍ H. P. Benson 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 276 KB

A projection and division method for pro

✍ V.P. Belukhin 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 852 KB

Realization of the branch and bound meth

✍ M.D. Ivanchev; I.G. Mitev; N.I. Yanev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 478 KB