A relation between the knapsack and group knapsack problems

DOI10.1016/S0166-218X(98)00061-4MaRDI QIDQ1270786zbMATH OpenFDO

Authors 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

dominated variableequality constrained knapsackFrobenius problemgroup knapsack

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• A note on the solution of group knapsack problems
• Knapsack problems in groups
• Knapsack problems in products of groups
• Knapsack in graph groups
• The Complexity of Knapsack in Graph Groups
• scientific article; zbMATH DE number 7139161
• Knapsack problem for nilpotent groups
• scientific article; zbMATH DE number 4031399
• Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
• On equivalent knapsack problems

Cites work

• A new enumeration scheme for the knapsack problem
• A periodicity lemma in linear Diophantine analysis
• An algorithm for a linear Diophantine equation and a problem of Frobenius
• An algorithm for the periodic solutions in the knapsack problem
• Complexity of the Frobenius problem
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3910473 (Why is no real title available?)
• scientific article; zbMATH DE number 3972952 (Why is no real title available?)
• scientific article; zbMATH DE number 3176160 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3495856 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• Integer Programming over a Finite Additive Group
• Lattice translates of a polytope and the Frobenius problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On a linear diophantine problem for geometrical type sequences
• On a linear diophantine problem of Frobenius
• On a Problem of Partitions
• On dominated terms in the general knapsack problem
• On equivalent knapsack problems
• On the linear diophantine problem of Frobenius.
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Representations of integers by linear forms in nonnegative integers
• Solution to a linear diophantine equation for nonnegative integers
• The diophantine problem of Frobenius: A close bound
• The Frobenius Problem and Maximal Lattice Free Bodies
• The Theory and Computation of Knapsack Functions
• Unsolved problems in number theory

Cited in

(6)

• On equivalent knapsack problems
• CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS
• STRUCTURE OF OPTIMAL SOLUTIONS OF A KNAPSACK PROBLEM SUBJECT TO A GIVEN TOTAL NUMBER OF VARIABLES USED
• A note on the solution of group knapsack problems
• The Complexity of Knapsack in Graph Groups
• Making change and finding repfigits: balancing a knapsack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1270786)