A hybrid algorithm for the unbounded knapsack problem

DOI10.1016/j.disopt.2008.09.004zbMath1160.90642OpenAlexW2119064613WikidataQ56050292 ScholiaQ56050292MaRDI QIDQ1013302

Rumen Andonov, Vincent Poirriez, Nicolas Yanev

Publication date: 17 April 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.09.004

zbMATH Keywords

dynamic programmingbranch and boundalgorithm engineering

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (7)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Tight bounds for periodicity theorems on the unbounded knapsack problem ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem ⋮ Bridging game theory and the knapsack problem: a theoretical formulation ⋮ Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem ⋮ A hybrid algorithm for the unbounded knapsack problem ⋮ Statistical mechanics analysis of generalized multi-dimensional knapsack problems

Uses Software

• CPLEX
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid algorithm for the unbounded knapsack problem
• Heuristics for the 0-1 multidimensional knapsack problem
• On dominated terms in the general knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited
• Computational aspects of hard knapsack problems.
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• A hard knapsack problem
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
• The Theory and Computation of Knapsack Functions

This page was built for publication: A hybrid algorithm for the unbounded knapsack problem