A note on the solution of group knapsack problems

DOI10.1080/02331939108843721zbMath0743.90081OpenAlexW2008320816MaRDI QIDQ3979526

Michael Schwarzer

Publication date: 26 June 1992

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843721

zbMATH Keywords

approximation algorithmgroup knapsack

Mathematics Subject Classification ID

Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Some polyhedra related to combinatorial problems
• Über die irrednziblen punkte des eckenpolyeders
• The nicholson principle in discrete dynamic optimization
• Integer Linear Programming: A Study in Computational Efficiency
• Generation of all integer points for given sets of linear inequalities
• Computational experience with a group theoretic integer programming algorithm

This page was built for publication: A note on the solution of group knapsack problems