✦ LIBER ✦

An Efficient Algorithm for the Knapsack Sharing Problem

✍ Scribed by Mhand Hifi; Slim Sadfi; Abdelkader Sbihi

Book ID: 118661148
Publisher: Springer US
Year: 2002
Tongue: English
Weight: 205 KB
Volume: 23
Category: Article
ISSN: 0926-6003
DOI: 10.1023/a:1019920507008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for the knapsack shar

An exact algorithm for the knapsack sharing problem

✍ Mhand Hifi; Hedi M'Halla; Slim Sadfi 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 317 KB

The Knapsack Sharing Problem: An Exact A

The Knapsack Sharing Problem: An Exact Algorithm

✍ Mhand Hifi; Slim Sadfi 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 187 KB

Some exact algorithms for the knapsack s

Some exact algorithms for the knapsack sharing problem

✍ Takeo Yamada; Mayumi Futakawa; Seiji Kataoka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 446 KB

The knapsack sharing problem (KSP) is formulated as an extension to the ordinary knapsack problem. The KSP is .AlP-hard. We present a branch-and-bound algorithm and a binary search algorithm to solve this problem to optimality. These algorithms are implemented and computational experiments are carde

An efficient algorithm for multi-dimensi

An efficient algorithm for multi-dimensional nonlinear knapsack problems

✍ Juan Chen; Xiao-ling Sun; Hui-juan Guo 📂 Article 📅 2006 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 428 KB

Processor-efficient hypercube algorithms

Processor-efficient hypercube algorithms for the knapsack problem

✍ Jianhua Lin; James A. Storer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 635 KB

An algorithm for the 0/1 Knapsack proble

An algorithm for the 0/1 Knapsack problem

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