New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
Computers and Operations Research
277 - 286
Item Usage Stats
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 starting from a specified root node has no more than p hops (edges). In this paper, the new models based on the Miller-Tucker-Zemlin (MTZ) subtour elimination constraints are developed and computational results together with comparisons against MTZ-based, flow-based, and hop-indexed formulations are reported. The first model is obtained by adapting the MTZ-based Asymmetric Traveling Salesman Problem formulation of Sherali and Driscoll  and the other two models are obtained by combining topology-enforcing and MTZ-related constraints offered by Akgün and Tansel (submitted for publication)  for HMST with the first model appropriately. Computational studies show that the best LP bounds of the MTZ-based models in the literature are improved by the proposed models. The best solution times of the MTZ-based models are not improved for optimally solved instances. However, the results for the harder, large-size instances imply that the proposed models are likely to produce better solution times. The proposed models do not dominate the flow-based and hop-indexed formulations with respect to LP bounds. However, good feasible solutions can be obtained in a reasonable amount of time for problems for which even the LP relaxations of the flow-based and hop-indexed formulations can be solved in about 2 days. © 2010 Elsevier Ltd. All rights reserved.
Asymmetric traveling salesman problem
Constrained minimum spanning tree
Traveling salesman problem
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.cor.2010.05.003
Showing items related by title, author, creator and subject.
Alanyalı, M. (Cambridge University Press, 1999)Management of a bufferless resource is considered under non-homogeneous demand consisting of one-unit and two-unit requests. Two-unit requests can be served only by a given partition of the resource. Three simple admission ...
Demiriz, A.; Bagherzadeh, N.; Ozturk, O. (Pergamon Press, 2014)This paper discusses heterogeneous Network-on-Chip (NoC) design from a Constraint Programming (CP) perspective and extends the formulation to solving Voltage-Frequency Island (VFI) problem. In general, VFI is a superior ...
Bektaş, T.; Elmastaş, S. (Palgrave Macmillan Ltd., 2007)In this paper, an exact solution approach is described for solving a real-life school bus routing problem (SBRP) for transporting the students of an elementary school throughout central Ankara, Turkey. The problem is ...