Solving the optimum communication spanning tree problem (Q1991267): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2018.07.055 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129476440 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2018.07.055 / rank | |||
Normal rank | |||
Latest revision as of 17:47, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the optimum communication spanning tree problem |
scientific article |
Statements
Solving the optimum communication spanning tree problem (English)
0 references
30 October 2018
0 references
networks
0 references
network optimization
0 references
Benders decomposition
0 references
spanning trees
0 references
0 references
0 references
0 references
0 references
0 references
0 references
