A hybrid algorithm for the unbounded knapsack problem
type: Item
instance of: scholarly article
title: A hybrid algorithm for the unbounded knapsack problem
zbMATH Open document ID: 1160.90642
author: Vincent Poirriez
author: Rumen Andonov
author: Nicolas Yanev
published in: Discrete Optimization
publication date: 2009-04-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5544692
zbMATH Keywords: branch and bound
zbMATH Keywords: dynamic programming
zbMATH Keywords: algorithm engineering
Wikidata QID: Q56050292
describes a project that uses: CPLEX
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.disopt.2008.09.004
OpenAlex ID: W2119064613
cites work: Unbounded knapsack problem: Dynamic programming revisited
cites work: A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
cites work: Heuristics for the 0-1 multidimensional knapsack problem
cites work: Computational aspects of hard knapsack problems.
cites work: A hard knapsack problem
cites work: Q5675139
cites work: The Theory and Computation of Knapsack Functions
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
cites work: Q3993418
cites work: Q4040221
cites work: Q4821303
cites work: Q3678962
cites work: On dominated terms in the general knapsack problem
DOI: 10.1016/J.DISOPT.2008.09.004
description: scientific article; zbMATH DE number 5544692