✦ LIBER ✦

A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem

✍ Scribed by Mohamed Djerdjour; Kamlesh Mathur; Harvey M. Salkin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for multi-d

✍ Juan Sun; Hong-bo Sheng; Xiao-ling Sun 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 163 KB

A Scatter Search Method for the Bi-Crite

✍ Carlos Gomes da Silva; João Clímaco; José Figueira 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 500 KB

A class of generalized greedy algorithms

✍ A.H.G. Rinnooy Kan; L. Stougie; C. Vercellis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A Lagrangian relaxation algorithm for sp

✍ I.Z. Milis; V.F. Magirou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 578 KB

A finite algorithm for solving general q

✍ Immanuel M. Bomze; Gabriele Danninger 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 756 KB

A quadratically-convergent algorithm for

✍ Stephen M. Robinson 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 458 KB