Pages that link to "Item:Q2467131"
From MaRDI portal
The following pages link to Algorithms for the bounded set-up knapsack problem (Q2467131):
Displaying 14 items.
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- Pseudopolynomial algorithms for the solution of backpack problems (Q1325402) (← 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)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- (Q3751378) (← links)
- A Minimal Algorithm for the Bounded Knapsack Problem (Q4427321) (← links)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603) (← links)