A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
From MaRDI portal
Publication:4376743
DOI10.1287/IJOC.9.4.431zbMATH Open0901.90171OpenAlexW2142105839MaRDI QIDQ4376743FDOQ4376743
Authors: Geon Cho, Dong X. Shaw 
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
Recommendations
Cited In (20)
- An linear programming based lower bound for the simple assembly line balancing problem
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
- Locating tree-shaped facilities using the ordered median objective
- Island partition of the distribution system with distributed generation
- Title not available (Why is that?)
- Exact and heuristic algorithms for dynamic tree simplification
- Subset sum problems with digraph constraints
- Vertex covering with capacitated trees
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
- Title not available (Why is that?)
- Linear pseudo-polynomial factor algorithm for automaton constrained tree knapsack problem
- Tree knapsack approaches for local access network design
- A pegging approach to the precedence-constrained knapsack problem
- Exact algorithms for the product configuration problem
- The connected critical node problem
- Title not available (Why is that?)
- 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
- Exact approaches for solving a covering problem with capacitated subtrees
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)
