A relation between the knapsack and group knapsack problems

DOI10.1016/S0166-218X(98)00061-4zbMath0910.90224MaRDI QIDQ1270786

Nan Zhu

Publication date: 3 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Frobenius problemgroup knapsackdominated variableequality constrained knapsack

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the periodic solutions in the knapsack problem
• On equivalent knapsack problems
• A new enumeration scheme for the knapsack problem
• The diophantine problem of Frobenius: A close bound
• An algorithm for a linear Diophantine equation and a problem of Frobenius
• Lattice translates of a polytope and the Frobenius problem
• A periodicity lemma in linear Diophantine analysis
• On dominated terms in the general knapsack problem
• On a linear diophantine problem for geometrical type sequences
• Complexity of the Frobenius problem
• Representations of integers by linear forms in nonnegative integers
• The Frobenius Problem and Maximal Lattice Free Bodies
• Solution to a linear diophantine equation for nonnegative integers
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On the linear diophantine problem of Frobenius.
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• The Theory and Computation of Knapsack Functions
• Integer Programming over a Finite Additive Group
• On a linear diophantine problem of Frobenius
• On a Problem of Partitions
• Unsolved problems in number theory

This page was built for publication: A relation between the knapsack and group knapsack problems