New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q336681 |
Changed an Item |
||
Property / author | |||
Property / author: Barbaros C. Tansel / rank | |||
Normal rank |
Revision as of 14:41, 13 February 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