An exact method to generate all nondominated spanning trees (Q2954355)
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 6674246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact method to generate all nondominated spanning trees |
scientific article; zbMATH DE number 6674246 |
Statements
An exact method to generate all nondominated spanning trees (English)
0 references
12 January 2017
0 references
minimum spanning tree
0 references
integer linear programming
0 references
multiple objective linear optimization
0 references
combinatorial optimization
0 references
branch and bound method
0 references
0 references
0 references
0 references
0.9082464
0 references
0.8892381
0 references
0.87909955
0 references
0.8706476
0 references
0.8693057
0 references
0.8681993
0 references
0.86357594
0 references
