Pages that link to "Item:Q1652523"
From MaRDI portal
The following pages link to Exact approaches for the knapsack problem with setups (Q1652523):
Displaying 14 items.
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← 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)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- The replenishment problem with multiple articles and an order threshold (Q2669586) (← 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)
