Design of capacitated degree constrained min-sum arborescence (Q2085507): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s12597-022-00575-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12597-022-00575-3 / rank | |||
Normal rank | |||
Latest revision as of 00:24, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Design of capacitated degree constrained min-sum arborescence |
scientific article |
Statements
Design of capacitated degree constrained min-sum arborescence (English)
0 references
18 October 2022
0 references
integer programming
0 references
networks
0 references
heuristics
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0 references
0 references
