Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem

This paper studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to mod...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 65; pp. 1 - 18
Main Author: Leitner, Markus
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.01.2016
Pergamon Press Inc
Subjects:
Algorithms
Branch-and-cut
Computer simulation
Generalized network design
Graph algorithms
Graph theory
Graphs
Hop-constraints
Inequalities
Integer programming
Layered graph
Linear programming
Mathematical models
Operations research
Quality of service
Routers
Studies
Integer programming
Generalized network design
Hop-constraints
Layered graph
Branch-and-cut
ISSN:0305-0548, 1873-765X, 0305-0548
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to model the GHMSTP as an integer linear program and strengthening valid inequalities are studied. The obtained formulations are compared theoretically, i.e., by means of their linear programming relaxation. In addition, branch-and-cut approaches based on these formulations are developed and compared in a computational study. •New optimization problem generalizing the generalized minimum spanning tree problem and the hop constrained minimum spanning tree problem.•Extended formulations based on layered graph reformulations and strength- ening valid inequalities.•Theoretical and computational comparisons between all formulations.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2015.06.012