The following pages link to Knapsack problems with setups (Q1041933):
Displaying 26 items.
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- Optimized load planning for motorail transportation (Q342294) (← links)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- Extending Dantzig's bound to the bounded multiple-class binary knapsack problem (Q1396817) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- The knapsack problem with forfeits (Q2225068) (← links)
- Decomposition methods for the lot-sizing and cutting-stock problems in paper industries (Q2293861) (← links)
- A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- The replenishment problem with multiple articles and an order threshold (Q2669586) (← links)
- A Knapsack Secretary Problem with Applications (Q3603454) (← links)
- Technical Note—Some Very Easy Knapsack/Partition Problems (Q3703590) (← links)
- Improved dynamic programming and approximation results for the knapsack problem with setups (Q4642123) (← links)
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← 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)
