New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6035000 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph theory | |||
| Property / zbMATH Keywords: graph theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
integer programming | |||
| Property / zbMATH Keywords: integer programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
spanning trees | |||
| Property / zbMATH Keywords: spanning trees / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hop constraints | |||
| Property / zbMATH Keywords: hop constraints / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Miller-Tucker-Zemlin constraints | |||
| Property / zbMATH Keywords: Miller-Tucker-Zemlin constraints / rank | |||
Normal rank | |||
Revision as of 21:47, 29 June 2023
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
