✦ LIBER ✦

Separation algorithms for 0-1 knapsack polytopes

✍ Scribed by Konstantinos Kaparis; Adam N. Letchford

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing low-capacity 0–1 knapsack poly

✍ P. L. Hammer; U. N. Peled 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 312 KB

Primal separation for 0/1 polytopes

✍ Friedrich Eisenbrand; Giovanni Rinaldi; Paolo Ventura 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 241 KB

An algorithm for 0-1 multiple-knapsack p

✍ Ming S. Hung; John C. Fisk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

An algorithm for the 0/1 Knapsack proble

✍ Marion Lauriere 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 375 KB

A hypercube algorithm for the 0/1 Knapsa

✍ Jong Lee; Eugene Shragowitz; Sartaj Sahni 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 878 KB

An improved parallel algorithm for 0/1 k

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