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

Authors:
İbrahim Akgün
Affiliations:
Department of Industrial Engineering, Bilkent University, Bilkent 06800, Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2011

Citing 15
Cited 0

The design of centralized networks with reliability and availability constraints

Computers and Operations Research
An analytical comparison of different formulations of the travelling sales man problem

Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

Computers and Operations Research
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

INFORMS Journal on Computing
Packet Routing in Telecommunication Networks with Path and Flow Restrictions

INFORMS Journal on Computing
On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems

Operations Research
Some Approximation Results in Multicasting

Some Approximation Results in Multicasting
Design of Survivable Networks: A survey

Networks
Modeling and solving the rooted distance-constrained minimum spanning tree problem

Computers and Operations Research
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints

Computers and Operations Research
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Mathematical Programming: Series A and B
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints

Operations Research Letters
The 2-hop spanning tree problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 [18] and the other two models are obtained by combining topology-enforcing and MTZ-related constraints offered by Akgun and Tansel (submitted for publication) [20] 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.