An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact and heuristic approach for the d-minimum branch vertices problem |
scientific article; zbMATH DE number 6996629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact and heuristic approach for the \(d\)-minimum branch vertices problem |
scientific article; zbMATH DE number 6996629 |
Statements
An exact and heuristic approach for the \(d\)-minimum branch vertices problem (English)
0 references
21 December 2018
0 references
spanning tree
0 references
branch vertice
0 references
integer programming
0 references
metaheuristic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8720943331718445
0 references
0.8672744035720825
0 references
0.832240879535675
0 references
0.8316842913627625
0 references
