An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ro/2014029 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/RO/2014029 / rank | |||
Normal rank | |||
Latest revision as of 16:31, 30 December 2024
scientific article; zbMATH DE number 6430723
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem |
scientific article; zbMATH DE number 6430723 |
Statements
An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (English)
0 references
27 April 2015
0 references
spanning trees
0 references
multi-objective optimization
0 references
parallel partitioning method
0 references
0 references
0 references
0 references
0 references
0 references
