✦ LIBER ✦

Processor-efficient hypercube algorithms for the knapsack problem

✍ Scribed by Jianhua Lin; James A. Storer

Book ID: 108016308
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 635 KB
Volume: 13
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(91)90080-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hypercube algorithm for the 0/1 Knapsa

A hypercube algorithm for the 0/1 Knapsack problem

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

Numerical algorithms for the hypercube c

Numerical algorithms for the hypercube concurrent processor

✍ Jean E. Patterson; Farzin Manshadi; Ruel H. Calalo; Paulett C. Liewer; William A 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 270 KB

With the development of concurrent computing architectures which promise cost-effective means of obtaining supercomputing performance, there is much interest in applying and in evaluating the actual performance on large, computationally-intensive problems. Of particular interest is the concurrent pe

An Efficient Algorithm for the Knapsack

An Efficient Algorithm for the Knapsack Sharing Problem

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

Heuristic algorithms for the multiple kn

Heuristic algorithms for the multiple knapsack problem

✍ S. Martello; P. Toth 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 835 KB

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

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