Minimum‐weight rooted not‐necessarily‐spanning arborescence problem (Q4537614)
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 1762004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum‐weight rooted not‐necessarily‐spanning arborescence problem |
scientific article; zbMATH DE number 1762004 |
Statements
Minimum‐weight rooted not‐necessarily‐spanning arborescence problem (English)
0 references
1 July 2002
0 references
arborescence
0 references
tree
0 references
Lagrangian relaxation
0 references
acyclic graph
0 references
uncapacitated plant location
0 references
NP-hard
0 references
zero-one integer programming
0 references
heuristic
0 references
0.8268435001373291
0 references
0.811900794506073
0 references
0.7762094736099243
0 references
0.7759914398193359
0 references
