✦ LIBER ✦

Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem

✍ Scribed by Figueira, JosÃ© Rui; Paquete, LuÃs; SimÃµes, Marco; Vanderpooten, Daniel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming algorithms for the b

✍ Rong, Aiying; Figueira, José Rui 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Dynamic programming based algorithms for

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

Dynamic programming algorithms for the Z

✍ P. Toth 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 786 KB

An improved parallel algorithm for 0/1 k

✍ Gen-Huey Chen; Jin-Hwang Jang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Algorithm 632; a program for the 0--1 mu

✍ Martello, Silvano; Toth, Paolo 📂 Article 📅 1985 🏛 Association for Computing Machinery 🌐 English ⚖ 342 KB

A dynamic programming algorithm for the

✍ Luce Brotcorne; Saïd Hanafi; Raïd Mansi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 940 KB