𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New branch-and-bound algorithms for k-cardinality tree problems

✍ Scribed by L. Simonetti; F. Protti; Y. Frota; C.C. de Souza

Book ID
108120798
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
182 KB
Volume
37
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Local search algorithms for the k-cardin
Local search algorithms for the k-cardinality tree problem
✍ Christian Blum; Matthias Ehrgott πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 463 KB

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th

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