A branch-and-price-and-cut method for computing an optimal bramble (Q1751138)
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 branch-and-price-and-cut method for computing an optimal bramble |
scientific article; zbMATH DE number 6872068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-price-and-cut method for computing an optimal bramble |
scientific article; zbMATH DE number 6872068 |
Statements
A branch-and-price-and-cut method for computing an optimal bramble (English)
0 references
24 May 2018
0 references
bramble
0 references
branch-and-price
0 references
treewidth
0 references
integer programming
0 references
0 references
0 references
0 references
0.8694129
0 references
0.8643857
0 references
0 references
0.8585342
0 references
0.85776126
0 references
0.85676146
0 references
0.85284513
0 references
