Pages that link to "Item:Q342065"
From MaRDI portal
The following pages link to A dynamic programming algorithm for the knapsack problem with setup (Q342065):
Displaying 20 items.
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- An exact algorithm for the Knapsack problem with setup (Q840596) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism (Q1659226) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- An iterative dynamic programming approach for the temporal knapsack problem (Q2030285) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← 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)
- Dynamic programming algorithm with objective level cut for nonlinear knapsack problem (Q2823517) (← links)
- Improved dynamic programming and approximation results for the knapsack problem with setups (Q4642123) (← 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)
