Unbounded knapsack problems with arithmetic weight sequences
type: Item
instance of: scholarly article
title: Unbounded knapsack problems with arithmetic weight sequences
zbMATH Open document ID: 1215.90044
author: Gerhard J. Woeginger
author: Vladimir G. Deineko
published in: European Journal of Operational Research
publication date: 2011-06-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5910992
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: computational complexity
zbMATH Keywords: dynamic programming
zbMATH Keywords: polynomially solvable special case
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.03.028
OpenAlex ID: W2090987741
cites work: A linear algorithm for integer programming in the plane
cites work: On linear forms whose coefficients are in arithmetic progression
cites work: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
cites work: Integer Programming with a Fixed Number of Variables
cites work: When the Greedy Solution Solves a Class of Knapsack Problems
cites work: Q3993418
cites work: A new lower bound for the linear knapsack problem with general integer variables
cites work: On variations of the subset sum problem
cites work: Q3818127
cites work: A polynomially solvable special case of the unbounded knapsack problem
DOI: 10.1016/J.EJOR.2011.03.028
description: scientific article; zbMATH DE number 5910992