𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem

✍ Scribed by A.O. Alekseyev; O.G. Alekseyev; V.D. Kiselev


Publisher
Elsevier Science
Year
1990
Weight
123 KB
Volume
30
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Effect of the selection of branch variab
✍ Katsumi Onishi; Hiroyuki Ebara; Hideo Nakano πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 522 KB

The branch and bound method is a solution method which is used in deriving the optimal solution for combinatorial optimization problems. The parallel implementation of the branch and bound method is considered, aiming at expansion of the range of applicable problems. With recent advances in PCs and