A note on the solution of group knapsack problems
From MaRDI portal
Recommendations
Cites work
- A note on two problems in connexion with graphs
- Computational experience with a group theoretic integer programming algorithm
- Generation of all integer points for given sets of linear inequalities
- scientific article; zbMATH DE number 3763671 (Why is no real title available?)
- scientific article; zbMATH DE number 3791939 (Why is no real title available?)
- Integer Linear Programming: A Study in Computational Efficiency
- Some polyhedra related to combinatorial problems
- The nicholson principle in discrete dynamic optimization
- Über die irrednziblen punkte des eckenpolyeders
Cited in
(6)- A relation between the knapsack and group knapsack problems
- STRUCTURE OF OPTIMAL SOLUTIONS OF A KNAPSACK PROBLEM SUBJECT TO A GIVEN TOTAL NUMBER OF VARIABLES USED
- Minmax linear knapsack problem with grouped variables and gub
- The Complexity of Knapsack in Graph Groups
- scientific article; zbMATH DE number 7139161 (Why is no real title available?)
- Test sets of the knapsack problem and simultaneous Diophantine approximation
This page was built for publication: A note on the solution of group knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979526)
