Cyclic group and knapsack facets

Cyclic group and knapsack facets

0.00 Avg rating0 Votes
Article ID: iaor20041804
Country: Germany
Volume: 96
Issue: 2
Start Page Number: 377
End Page Number: 408
Publication Date: Jan 2003
Journal: Mathematical Programming
Authors: , , ,
Keywords: knapsack problem
Abstract:

Any integer program may be relaxed to a group problem. We define the master cyclic group problem and several master knapsack problems, show the relationship between the problems, and give several classes of facet-defining inequalities for each problem, as well as a set of mappings that take facets from one type of master polyhedra to another.

Reviews

Required fields are marked *. Your email address will not be published.