A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem (Q4345574)
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 1038841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem |
scientific article; zbMATH DE number 1038841 |
Statements
23 July 1997
0 references
branch-and-cut
0 references
NP-hard extension
0 references
minimum-weight arborescence
0 references
resource-constrained minimum-weight arborescence
0 references
design of distribution network
0 references
heuristic
0 references
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem (English)
0 references
0.8062512278556824
0 references
0.8030977845191956
0 references
0.8016253709793091
0 references
0.7961747050285339
0 references
0.7796670198440552
0 references
