Lagrangian and branch-and-cut approaches for upgrading spanning tree problems - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2017

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems

(1) , (2, 3)
1
2
3

Abstract

Problems aiming at finding budget constrained optimal upgrading schemes to improve network performance have received attention over the last two decades. In their general setting, these problems consist of designing a network and, simultaneously, allocating (limited) upgrading resources in order to enhance the performance of the designed network. In this paper we address two particular optimal upgrading network design problems; in both cases, the sought-after layout corresponds to a spanning tree of the input network and upgrading decisions are to be taken on nodes. We design Mixed Integer Programming-based algorithmic schemes to solve the considered problems: Lagrangian relaxation approaches and branch-and-cut algorithms. Along with the designed algorithms, different enhancements, including valid inequalities, primal heuristic and variable fixing procedures, are proposed. Using two set of instances, we experimentally compare the designed algorithms and explore the benefits of the devised enhancements. The results show that the proposed approaches are effective for solving to optimality most of the instances in the testbed, or manage to obtain solutions and bounds giving very small optimality gaps. Besides, the proposed enhancements turn out to be beneficial for improving the performance of the algorithms.
Not file

Dates and versions

hal-01666285 , version 1 (18-12-2017)

Identifiers

Cite

Eduardo Álvarez-Miranda, Markus Sinnl. Lagrangian and branch-and-cut approaches for upgrading spanning tree problems. Computers and Operations Research, 2017, 83, pp.13-27. ⟨10.1016/j.cor.2017.01.014⟩. ⟨hal-01666285⟩
78 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More