✦ LIBER ✦

Solving a Class of Multiplicative Programs with 0–1 Knapsack Constraints

✍ Scribed by T. Kuno

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The 0–1 knapsack problem with multiple c

✍ Robert M. Nauss 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 787 KB

Coefficient reduction for knapsack-like

✍ B.L. Dietrich; L.F. Escudero 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Solving a class of multiplicative progra

✍ Moshe Sniedovich; Suzanne Findlay 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 303 KB

Lifted cover facets of the 0–1 knapsack

✍ George L. Nemhauser; Pamela H. Vance 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 440 KB

A Class of Hard Small 0-1 Programs

✍ Cornuejols, G.; Dawande, M. 📂 Article 📅 1999 🏛 Operations Research Society of America 🌐 English ⚖ 141 KB

On the Dietrich-Escudero approach for so

✍ L.F. Escudero; G. Pérez; A. Garin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 75 KB