Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432)
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 7683744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Valid Inequalities and Separation Algorithms for the Set Partitioning Problem |
scientific article; zbMATH DE number 7683744 |
Statements
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (English)
0 references
9 May 2023
0 references
set partitioning
0 references
cutting planes
0 references
rank-1 Chvátal-Gomory inequalities
0 references
clique
0 references
separation algorithm
0 references
0 references
0 references
0.8353897929191589
0 references
0.782429575920105
0 references
0.7809851169586182
0 references
