A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
From MaRDI portal
Publication:4376743
DOI10.1287/ijoc.9.4.431zbMath0901.90171OpenAlexW2142105839MaRDI QIDQ4376743
Publication date: 26 November 1998
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.9.4.431
Related Items
Extended formulations for the cardinality constrained subtree of a tree problem ⋮ A pegging approach to the precedence-constrained knapsack problem ⋮ Subset sum problems with digraph constraints ⋮ An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks ⋮ The connected critical node problem ⋮ Exact algorithms for the product configuration problem ⋮ Vertex covering with capacitated trees ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ Shift-and-merge technique for the DP solution of the time-constrained backpacker problem ⋮ Island partition of the distribution system with distributed generation ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ Tree knapsack approaches for local access network design ⋮ An linear programming based lower bound for the simple assembly line balancing problem ⋮ Heuristic and exact algorithms for the precedence-constrained knapsack problem ⋮ Exact and heuristic algorithms for dynamic tree simplification
