A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (Q6164630)
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 7706751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem |
scientific article; zbMATH DE number 7706751 |
Statements
A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (English)
0 references
4 July 2023
0 references
precedence constrained arborescences
0 references
mixed integer linear programming
0 references
branch and bound
0 references
Lagrangian relaxation
0 references
network optimization
0 references
0 references
0 references
0 references
0.910394549369812
0 references
0.7575043439865112
0 references
0.7526142001152039
0 references
0.7438296675682068
0 references
