A computational comparison of Gomory and knapsack cuts (Q580177)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A computational comparison of Gomory and knapsack cuts |
scientific article; zbMATH DE number 4016598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational comparison of Gomory and knapsack cuts |
scientific article; zbMATH DE number 4016598 |
Statements
A computational comparison of Gomory and knapsack cuts (English)
0 references
1987
0 references
We consider solving integer programs by a variety of Gomory cutting planes and by the recently developed method of knapsack cuts. By examining the performance of each method on a large number of test problems, we determine which method is best for general integer and for 0-1 problems.
0 references
Gomory cutting planes
0 references
knapsack cuts
0 references
test problems
0 references
0.8399823307991028
0 references
0.825461208820343
0 references
0.8145080804824829
0 references
0.8019073009490967
0 references
0.8003565073013306
0 references
