IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Evolutionary algorithm for P2P multicasting network design problem
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
The two level network design problem with secondary hop constraints
INOC'11 Proceedings of the 5th international conference on Network optimization
Stabilized branch-and-price for the rooted delay-constrained steiner tree problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Hop-level flow formulation for the hop constrained survivable network design problem
INOC'11 Proceedings of the 5th international conference on Network optimization
The Journal of Supercomputing
The time dependent traveling salesman problem: polyhedra and branch-cut-and-price algorithm
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem
Operations Research Letters
On the hop constrained steiner tree problem with multiple root nodes
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On solving the rooted delay- and delay-variation-constrained steiner tree problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Degree constrained minimum spanning tree problem: a learning automata approach
The Journal of Supercomputing
Shallow-Light steiner arborescences with vertex delays
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
INFORMS Journal on Computing
Characterizing acyclic graphs by labeling edges
Discrete Applied Mathematics
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
Discrete Applied Mathematics
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures
Discrete Applied Mathematics
| Hi-index | 0.00 |
The hop-constrained minimum spanning tree problem (HMSTP) is an NP-hard problem arising in the design of centralized telecommunication networks with quality of service constraints. We show that the HMSTP is equivalent to a Steiner tree problem (STP) in an appropriate layered graph. We prove that the directed cut model for the STP defined in the layered graph, dominates the best previously known models for the HMSTP. We also show that the Steiner directed cuts in the extended layered graph space can be viewed as being a stronger version of some previously known HMSTP cuts in the original design space. Moreover, we show that these strengthened cuts can be combined and projected into new families of cuts, including facet defining ones, in the original design space. We also adapt the proposed approach to the diameter-constrained minimum spanning tree problem (DMSTP). Computational results with a branch-and-cut algorithm show that the proposed method is significantly better than previously known methods on both problems.