An exact algorithm for large unbounded knapsack problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3989108 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3580280 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A New Algorithm for the 0-1 Knapsack Problem
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- A better step-off algorithm for the knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- An Enumeration Algorithm for Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- On equivalent knapsack problems
- Some applications of the theory of dynamic programming -- a review
- The Theory and Computation of Knapsack Functions
- When the Greedy Solution Solves a Class of Knapsack Problems
Cited in
(24)- scientific article; zbMATH DE number 6869279 (Why is no real title available?)
- Extension of Brickell’S Algorithm for Breaking High Density Knapsacks
- The unbounded knapsack problem
- Unbounded knapsack problems with arithmetic weight sequences
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- A theory of auto-scaling for resource reservation in cloud services
- A note on dominance relation in unbounded knapsack problems
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem
- An approximate solution approach for a scenario-based capital budgeting model
- A constructive periodicity bound for the unbounded knapsack problem
- Algorithms with guarantee value for knapsack problems
- An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
- Robust efficiency measures for linear knapsack problem variants
- Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering
- Algorithms for some hard knapsack problems
- Fractal patterns related to dividing coins
- Determining the K-best solutions of knapsack problems
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- A study on the budget constrained facility location model considering inventory management cost
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- An algorithm for the continuous variable upper bound knapsack problem
- Exact optimization and decomposition approaches for shelf space allocation
- scientific article; zbMATH DE number 1264415 (Why is no real title available?)
This page was built for publication: An exact algorithm for large unbounded knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913659)
