A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
From MaRDI portal
Publication:4376743
DOI10.1287/ijoc.9.4.431zbMath0901.90171MaRDI 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
Island partition of the distribution system with distributed generation, Extended formulations for the cardinality constrained subtree of a tree 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, Locating tree-shaped facilities using the ordered median objective, 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