A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
From MaRDI portal
Recommendations
Cited in
(21)- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
- Subset sum problems with digraph constraints
- Exact approaches for solving a covering problem with capacitated subtrees
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
- Locating tree-shaped facilities using the ordered median objective
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- A pegging approach to the precedence-constrained knapsack problem
- Tree knapsack approaches for local access network design
- An linear programming based lower bound for the simple assembly line balancing problem
- Exact and heuristic algorithms for dynamic tree simplification
- The connected critical node problem
- scientific article; zbMATH DE number 1769298 (Why is no real title available?)
- scientific article; zbMATH DE number 1895857 (Why is no real title available?)
- Linear pseudo-polynomial factor algorithm for automaton constrained tree knapsack problem
- Island partition of the distribution system with distributed generation
- scientific article; zbMATH DE number 2217849 (Why is no real title available?)
- Exact algorithms for the product configuration problem
- Vertex covering with capacitated trees
- Extended formulations for the cardinality constrained subtree of a tree problem
This page was built for publication: A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376743)
