✦ LIBER ✦

A recursive branch and bound algorithm for the multidimensional knapsack problem

✍ Scribed by Arne Thesen

Publisher: John Wiley and Sons
Year: 1975
Tongue: English
Weight: 655 KB
Volume: 22
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800220210

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational results with a branch-and-

Computational results with a branch-and-bound algorithm for the general knapsack problem

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

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 branch and bound algorithm for the min

A branch and bound algorithm for the minimum storage-time sequencing problem

✍ P. Detti; D. Pacciarelli 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

A branch and bound algorithm for the mul

A branch and bound algorithm for the multiple depot vehicle scheduling problem

✍ G. Carpaneto; M. Dell'amico; M. Fischetti; P. Toth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

A branch and bound algorithm for the cap

A branch and bound algorithm for the capacitated minimum spanning tree problem

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

An LC branch-and-bound algorithm for the

An LC branch-and-bound algorithm for the module assignment problem

✍ Maw-Sheng Chern; G.H. Chen; Pangfeng Liu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 707 KB