New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:47, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints |
scientific article |
Statements
New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (English)
0 references
14 May 2012
0 references
graph theory
0 references
integer programming
0 references
spanning trees
0 references
hop constraints
0 references
Miller-Tucker-Zemlin constraints
0 references
