Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (Q5940609): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / rank | |||
Normal rank | |||
Revision as of 00:12, 29 February 2024
scientific article; zbMATH DE number 1632044
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
