Pages that link to "Item:Q1586807"
From MaRDI portal
The following pages link to Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807):
Displaying 10 items.
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods (Q1755382) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- The knapsack problem with neighbour constraints (Q1932367) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Piece selection algorithms for layered video streaming in P2P networks (Q2440125) (← links)
- Exact and heuristic algorithms for dynamic tree simplification (Q2583510) (← links)
- Large-scale multi-period precedence constrained knapsack problem: a mining application (Q2883587) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307) (← links)