Pages that link to "Item:Q4376743"
From MaRDI portal
The following pages link to A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743):
Displayed 9 items.
- Island partition of the distribution system with distributed generation (Q546403) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Tree knapsack approaches for local access network design (Q2503262) (← links)
- An linear programming based lower bound for the simple assembly line balancing problem (Q2569061) (← links)
- Exact and heuristic algorithms for dynamic tree simplification (Q2583510) (← links)