par Leitner, Markus 
Référence Computers & operations research, 65, page (1-18), 3812
Publication Publié, 2016-07
Référence Computers & operations research, 65, page (1-18), 3812
Publication Publié, 2016-07
Article révisé par les pairs
| Résumé : | Abstract 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. |
