The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663): 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.dam.2011.08.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981354702 / rank | |||
Normal rank | |||
Revision as of 21:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm |
scientific article |
Statements
The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (English)
0 references
22 September 2015
0 references
combinatorial optimization
0 references
min-degree constrained minimum spanning tree problem
0 references
branch-and-cut
0 references
integer programming formulations
0 references
