Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:23, 1 February 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
