An exact algorithm for large unbounded knapsack problems

DOI10.1016/0167-6377(90)90035-4zbMath0699.90076OpenAlexW2127967088MaRDI QIDQ913659

Paolo Toth, Silvano Martello

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90035-4

zbMATH Keywords

upper boundsbranch and bound algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10)

Related Items (13)

A study on the budget constrained facility location model considering inventory management cost ⋮ A Theory of Auto-Scaling for Resource Reservation in Cloud Services ⋮ Algorithms with guarantee value for knapsack problems ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Fractal patterns related to dividing coins ⋮ Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering ⋮ Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem ⋮ The Unbounded Knapsack Problem ⋮ A note on dominance relation in unbounded knapsack problems ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem ⋮ Strip generation algorithms for constrained two-dimensional two-staged cutting problems ⋮ An approximate solution approach for a scenario-based capital budgeting model ⋮ Exact optimization and decomposition approaches for shelf space allocation

Cites Work

• On equivalent knapsack problems
• A better step-off algorithm for the knapsack problem
• 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
• A New Algorithm for the 0-1 Knapsack Problem
• A Polynomial Algorithm for the Two-Variable Integer Programming Problem
• An Algorithm for Large Zero-One Knapsack Problems
• When the Greedy Solution Solves a Class of Knapsack Problems
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Some Applications of the Theory of Dynamic Programming—A Review
• The Theory and Computation of Knapsack Functions
• An Enumeration Algorithm for Knapsack Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An exact algorithm for large unbounded knapsack problems