✦ LIBER ✦

New upper bounds and exact methods for the knapsack sharing problem

✍ Scribed by Hifi, Mhand; Wu, Lei

Book ID: 121445671
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 348 KB
Volume: 227
Category: Article
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.11.040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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

A new upper bound for the 0-1 quadratic

A new upper bound for the 0-1 quadratic knapsack problem

✍ Alain Billionnet; Alain Faye; Éric Soutif 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 120 KB

Upper and lower bounding procedures for

Upper and lower bounding procedures for the multiple knapsack assignment problem

✍ Kataoka, Seiji; Yamada, Takeo 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Upper bounds and exact algorithms for -d

Upper bounds and exact algorithms for -dispersion problems

✍ David Pisinger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 230 KB

An upper bound for the zero-one knapsack

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 831 KB