✦ LIBER ✦

The knapsack problem with a minimum filling constraint

✍ Scribed by Xu, Zhou

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The knapsack problem with neighbour cons

✍ Borradaile, Glencora; Heeringa, Brent; Wilfong, Gordon 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Knapsack problem with probability constr

✍ Alexei A. Gaivoronski; Abdel Lisser; Rafael Lopez; Hu Xu 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 190 KB

The zero-one knapsack problem with equal

✍ L. Kaufman; F. Plastria; S. Tubeeckx 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 713 KB

A branch-and-price algorithm for the var

✍ Andrea Bettinelli; Alberto Ceselli; Giovanni Righini 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 492 KB

The three-dimensional knapsack problem w

✍ Mauro Maria Baldi; Guido Perboli; Roberto Tadei 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 656 KB

The knapsack problem with disjoint multi

✍ Vijay Aggarwal; Narsingh Deo; Dilip Sarkar 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 750 KB