Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 611366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts |
scientific article; zbMATH DE number 611366 |
Statements
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (English)
0 references
26 July 1994
0 references
clique and cover induced inequalities
0 references
0-1 knapsack constraints
0 references
Chvatal- Gomory inequalities
0 references
0 references
0.8068193793296814
0 references
0.8063527941703796
0 references
0.7779555916786194
0 references
0.7778691053390503
0 references
0.7739512324333191
0 references
