Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2015.04.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041365558 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem |
scientific article |
Statements
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (English)
0 references
6 October 2016
0 references
integer programming
0 references
spanning tree
0 references
branch vertices
0 references
