✦ LIBER ✦

Computational aspects of hard Knapsack problems

✍ Scribed by L. Caccetta; A. Kulanoot

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 559 KB
Volume: 47
Category: Article
ISSN: 0362-546X
DOI: 10.1016/s0362-546x(01)00658-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hard knapsack problem

✍ Chia-Shin Chung; Ming S. Hung; Walter O. Rom 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 661 KB

Some computational results on real 0–1 k

Some computational results on real 0–1 knapsack problems

✍ Richard A. Murphy 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Comment on ‘some computational results o

Comment on ‘some computational results on real 0–1 knapsack problems’

✍ Egon Balas; Robert Nauss; Eitan Zemel 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 96 KB

A computational comparison of gomory and

A computational comparison of gomory and knapsack cuts

✍ Larry Jenkins; Dave Peters 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Ergonomic aspects of man—computer proble

Ergonomic aspects of man—computer problem solving

✍ T.F.M. Stewart 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 422 KB

The paper reports a survey of interactive computer usage by designers, engineers, economists and other specialists in several industrial organisations. Sixty-nine of these specialists were interviewed about both hardware interface problems, eg, keyboard layout, and software interface problems, eg, h

Computational aspects of the maximum div

Computational aspects of the maximum diversity problem

✍ Jay B. Ghosh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 418 KB