✦ LIBER ✦

Breakpoint searching algorithms for the continuous quadratic knapsack problem

✍ Scribed by Krzysztof C. Kiwiel

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 425 KB
Volume: 112
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-006-0050-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Variable Fixing Algorithms for the Conti

Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem

✍ K. C. Kiwiel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 364 KB

On Linear-Time Algorithms for the Contin

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

✍ K. C. Kiwiel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 208 KB

On the continuous quadratic knapsack pro

On the continuous quadratic knapsack problem

✍ A. G. Robinson; N. Jiang; C. S. Lerme 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 495 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

A linear-time algorithm for solving cont

A linear-time algorithm for solving continuous maximin knapsack problems

✍ Takahito Kuno; Hiroshi Konno; Eitan Zemel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 221 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