Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations |
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
