✦ LIBER ✦

Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

✍ Scribed by N. Samphaiboon; Y. Yamada

Book ID: 111535706
Publisher: Springer
Year: 2000
Tongue: English
Weight: 150 KB
Volume: 105
Category: Article
ISSN: 0022-3239
DOI: 10.1023/a:1004649425222

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic algorithms for the multiple kn

Heuristic algorithms for the multiple knapsack problem

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

Clique-based facets for the precedence c

Clique-based facets for the precedence constrained knapsack problem

✍ Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 643 KB

Lifting valid inequalities for the prece

Lifting valid inequalities for the precedence constrained knapsack problem

✍ R.L.M.J. van de Leensel; C.P.M. van Hoesel; J.J. van de Klundert 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 163 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

Heuristic algorithms for the general non

Heuristic algorithms for the general nonlinear separable knapsack problem

✍ Claudia D’Ambrosio; Silvano Martello 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 236 KB

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