Pages that link to "Item:Q4642123"
From MaRDI portal
The following pages link to Improved dynamic programming and approximation results for the knapsack problem with setups (Q4642123):
Displaying 16 items.
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647) (← links)
- (Q4640248) (← links)
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
