Pages that link to "Item:Q2583510"
From MaRDI portal
The following pages link to Exact and heuristic algorithms for dynamic tree simplification (Q2583510):
Displaying 4 items.
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- An Iterative Heuristic Algorithm for Tree Decomposition (Q3625014) (← links)
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743) (← links)
- The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem (Q4540048) (← links)