A hybrid algorithm for the unbounded knapsack problem
From MaRDI portal
Publication:1013302
DOI10.1016/j.disopt.2008.09.004zbMath1160.90642WikidataQ56050292 ScholiaQ56050292MaRDI QIDQ1013302
Rumen Andonov, Nicolas Yanev, Vincent Poirriez
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
Related Items
Uses Software
Cites Work
- Unnamed Item
- 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 New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
- The Theory and Computation of Knapsack Functions