New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.01.051 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984620595 / rank | |||
Normal rank | |||
Revision as of 00:57, 20 March 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
