Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.03.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2592716126 / rank | |||
Normal rank | |||
Revision as of 22:16, 19 March 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
