A hybrid algorithm for the unbounded knapsack problem

DOI10.1016/J.DISOPT.2008.09.004MaRDI QIDQ1013302zbMATH OpenOpenAlexWikidataFDO

Authors Vincent Poirriez, Rumen Andonov, 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

algorithm engineeringbranch and bounddynamic programming

Mathematics Subject Classification ID

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

Recommendations

• The unbounded knapsack problem
• scientific article; zbMATH DE number 6869279
• An empirical analysis of exact algorithms for the unbounded knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited
• A Minimal Algorithm for the Bounded Knapsack Problem

Cites work

• A hard knapsack problem
• A hybrid algorithm for the unbounded knapsack problem
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
• Computational aspects of hard knapsack problems.
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Heuristics for the 0-1 multidimensional knapsack problem
• scientific article; zbMATH DE number 3900494 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• On dominated terms in the general knapsack problem
• The Theory and Computation of Knapsack Functions
• Unbounded knapsack problem: Dynamic programming revisited

Cited in

(14)

• A hybrid algorithm for the unbounded knapsack problem
• A note on the max-min 0-1 knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited
• An empirical analysis of exact algorithms for the unbounded knapsack problem
• Bridging game theory and the knapsack problem: a theoretical formulation
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
• Hybrid rounding techniques for knapsack problems
• The unbounded knapsack problem
• Tight bounds for periodicity theorems on the unbounded knapsack problem
• A Minimal Algorithm for the Bounded Knapsack Problem
• An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
• A minimal algorithm for the bounded knapsack problem
• Statistical mechanics analysis of generalized multi-dimensional knapsack problems

Describes a project that uses

Uses Software

• CPLEX
• Knapsack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013302)