✦ LIBER ✦

Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm

✍ Scribed by Stefanie Kosuch; Abdel Lisser

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 526 KB
Volume: 176
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-009-0577-5

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

A parallel algorithm for the 0–1 knapsac

A parallel algorithm for the 0–1 knapsack problem

✍ W. Loots; T. H. C. Smith 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 626 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

The critical-item, upper bounds, and a b

The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem

✍ Shaw, Dong X.; Cho, Geon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac

A fully polynomial approximation algorit

A fully polynomial approximation algorithm for the 0–1 knapsack problem

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A Bound and Bound algorithm for the zero

A Bound and Bound algorithm for the zero-one multiple knapsack problem

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