Pages that link to "Item:Q913659"
From MaRDI portal
The following pages link to An exact algorithm for large unbounded knapsack problems (Q913659):
Displaying 24 items.
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Fractal patterns related to dividing coins (Q340462) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- An approximate solution approach for a scenario-based capital budgeting model (Q993706) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- An algorithm for the continuous variable upper bound knapsack problem (Q1108930) (← links)
- A note on dominance relation in unbounded knapsack problems (Q1180824) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- A constructive periodicity bound for the unbounded knapsack problem (Q1758270) (← links)
- Exact optimization and decomposition approaches for shelf space allocation (Q2077910) (← links)
- Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering (Q2399471) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem (Q2668788) (← links)
- Algorithms for some hard knapsack problems (Q2735077) (← links)
- Algorithms with guarantee value for knapsack problems (Q2903135) (← links)
- The Unbounded Knapsack Problem (Q2971610) (← links)
- A study on the budget constrained facility location model considering inventory management cost (Q3166271) (← links)
- (Q4233347) (← links)
- (Q4640248) (← links)
- An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (Q4661050) (← links)
- Extension of Brickell’S Algorithm for Breaking High Density Knapsacks (Q5000237) (← links)
- A Theory of Auto-Scaling for Resource Reservation in Cloud Services (Q5046013) (← links)