✦ LIBER ✦

Lagrangean methods for the 0–1 Quadratic Knapsack Problem

✍ Scribed by Philippe Michelon; Louis Veilleux

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear programming for the 0–1 quadratic

✍ Alain Billionnet; Frédéric Calmels 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 852 KB

A hypercube algorithm for the 0/1 Knapsa

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

Matroidal relaxations for 0–1 knapsack p

✍ Lígia Amado; Paulo Barcia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 379 KB

An improved parallel algorithm for 0/1 k

✍ Gen-Huey Chen; Jin-Hwang Jang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 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 expanding-core algorithm for the exac

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 747 KB