Browsing by Keywords "Spanning trees"

Now showing items 1-2 of 2

New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints

Akgün, İbrahim (Elsevier, 2010)

Given an undirected network with positive edge costs and a natural number p, the hop-constrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ...
New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints

Akgün, I.; Tansel, B. Ç. (Elsevier, 2011)

Given an undirected network with positive edge costs and a natural number p, the Hop-Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ...