The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:27, 5 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
