Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (Q5940609): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-001-0029-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987594150 / rank | |||
Normal rank | |||
Latest revision as of 00:46, 20 March 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
