Pages that link to "Item:Q4540048"
From MaRDI portal
The following pages link to The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem (Q4540048):
Displaying 8 items.
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Tree knapsack approaches for local access network design (Q2503262) (← links)
- Exact and heuristic algorithms for dynamic tree simplification (Q2583510) (← links)
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)