A relation between the knapsack and group knapsack problems
type: Item
instance of: scholarly article
title: A relation between the knapsack and group knapsack problems
zbMATH Open document ID: 0910.90224
DOI: 10.1016/S0166-218X(98)00061-4
author: Nan Zhu
published in: Discrete Applied Mathematics
publication date: 1998-11-03T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1218481
zbMATH Keywords: dominated variable
zbMATH Keywords: equality constrained knapsack
zbMATH Keywords: group knapsack
zbMATH Keywords: Frobenius problem
MaRDI profile type: Publication
cites work: On a linear diophantine problem for geometrical type sequences
cites work: On a Problem of Partitions
cites work: Q3843706
cites work: On a linear diophantine problem of Frobenius
cites work: Q3214706
cites work: The Theory and Computation of Knapsack Functions
cites work: Integer Programming over a Finite Additive Group
cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
cites work: An algorithm for a linear Diophantine equation and a problem of Frobenius
cites work: An algorithm for the periodic solutions in the knapsack problem
cites work: On equivalent knapsack problems
cites work: Solution to a linear diophantine equation for nonnegative integers
cites work: Unsolved problems in number theory
cites work: Q5595961
cites work: Lattice translates of a polytope and the Frobenius problem
cites work: Q3739205
cites work: The diophantine problem of Frobenius: A close bound
cites work: Q3993418
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Representations of integers by linear forms in nonnegative integers
cites work: Complexity of the Frobenius problem
cites work: The Frobenius Problem and Maximal Lattice Free Bodies
cites work: On the linear diophantine problem of Frobenius.
cites work: Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
cites work: Q4077727
cites work: Q3688459
cites work: A periodicity lemma in linear Diophantine analysis
cites work: A new enumeration scheme for the knapsack problem
cites work: On dominated terms in the general knapsack problem
Recommended article: A note on the solution of group knapsack problems
Recommended article: Knapsack problems in groups
Recommended article: Knapsack problems in products of groups
Recommended article: Knapsack in graph groups
Recommended article: The Complexity of Knapsack in Graph Groups
Recommended article: Q4973221
Recommended article: Knapsack problem for nilpotent groups
Recommended article: Q3771969
Recommended article: Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
Recommended article: On equivalent knapsack problems
description: scientific article; zbMATH DE number 1218481