Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2017.03.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2017.03.001 / rank | |||
Normal rank | |||
Latest revision as of 01:06, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations |
scientific article |
Statements
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (English)
0 references
11 July 2018
0 references
min-degree constrained minimum spanning tree problem
0 references
integer programming
0 references
Lagrangian heuristic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
