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 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Concorde / rank | |||
Normal rank | |||
Revision as of 13:47, 29 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
