Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (Q5940609)
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 1632044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of using small instance relaxations in parallel branch-and-cut |
scientific article; zbMATH DE number 1632044 |
Statements
Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (English)
0 references
9 August 2001
0 references
combinatorial optimization
0 references
polyhedra
0 references
branch-and-cut
0 references
0.8229275345802307
0 references
