Stable set reformulations for the degree preserving spanning tree problem

被引:0
|
作者
Lucena, Abilio [1 ]
da Cunha, Alexandre Salles [2 ]
机构
[1] Univ Fed Rio De Janeiro, Programa Engn Sistemas & Computacao, Rio De Janeiro, Brazil
[2] Univ Fed Minas Gerais, Dept Ciencia Computacao, Belo Horizonte, Brazil
关键词
Combinatorial optimization; Degree preserving spanning trees; Stable set; Branch-and-cut algorithms; Combinatorial benders decomposition; ALGORITHM; CLIQUES;
D O I
10.1016/j.ejor.2024.06.031
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Let G = ( V, E) ) be a connected undirected graph and assume that a spanning tree is available for it. Any vertex in this tree is called degree preserving if it has the same degree in the graph and in the tree. Building upon this concept, the Degree Preserving Spanning Tree Problem (DPSTP) asks for a spanning tree of G with as many degree preserving vertices as possible. DPSTP is very much intertwined with the most important application for it, so far, i.e., the online monitoring of arc flows in a water distribution network, what serves us as an additional motivation for our investigation. We show that degree preserving vertices correspond to a stable set of a properly defined DPSTP conflict graph. This, in turn, allows us to use valid inequalities for the Stable Set Polytope (SSP) and thus strengthen the DPSTP formulations previously suggested in the literature. In doing so, the Branch-and-cut and Benders Decomposition algorithms suggested for these formulations are greatly enhanced. Additionally, as a further contribution, we also introduce a new and very challenging set of DPSTP test instances, given by graphs that closely resemble water distribution networks. For these instances, the new algorithms very clearly outperform all previous DPSTP algorithms. They not only run faster than their competitors but are also less dependent on good initial DPSTP primal bounds. For previous DPSTP test sets, the new algorithms lag behind the best existing algorithm for them, which is based on Lagrangian relaxation. However, as compared to additional DPSTP previous algorithms that do not benefit from SSP inequalities, the new ones come much closer to the Lagrangian relaxation one.
引用
收藏
页码:50 / 61
页数:12
相关论文
共 50 条
  • [31] MIP reformulations of the probabilistic set covering problem
    Saxena, Anureet
    Goyal, Vineet
    Lejeune, Miguel A.
    MATHEMATICAL PROGRAMMING, 2010, 121 (01) : 1 - 31
  • [32] Primal dual based algorithm for degree-balanced spanning tree problem
    Ran, Yingli
    Chen, Zhihao
    Tang, Shaojie
    Zhang, Zhao
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 316 : 167 - 173
  • [33] Degree-constrained minimum spanning tree problem of uncertain random network
    Xin Gao
    Lifen Jia
    Samarjit Kar
    Journal of Ambient Intelligence and Humanized Computing, 2017, 8 : 747 - 757
  • [34] An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem
    Raidl, GR
    PROCEEDINGS OF THE 2000 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2000, : 104 - 111
  • [35] Variable neighborhood search for the degree-constrained minimum spanning tree problem
    Ribeiro, CC
    Souza, MC
    DISCRETE APPLIED MATHEMATICS, 2002, 118 (1-2) : 43 - 54
  • [36] Lower and upper bounds for the degree-constrained minimum spanning tree problem
    da Cunha, Alexandre Salles
    Lucena, Abilio
    NETWORKS, 2007, 50 (01) : 55 - 66
  • [37] A Lagrangean based heuristic for the degree constrained capacitated minimal spanning tree problem
    Kawatra, R
    DECISION SCIENCES INSTITUTE, 1997 ANNUAL MEETING, PROCEEDINGS, VOLS 1-3, 1997, : 915 - 917
  • [38] A new genetic algorithm for the degree-constrained minimum spanning tree problem
    Han, LX
    Wang, YP
    Guo, FY
    Proceedings of 2005 IEEE International Workshop on VLSI Design and Video Technology, 2005, : 125 - 128
  • [39] A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem
    Kavita Singh
    Shyam Sundar
    Soft Computing, 2020, 24 : 2169 - 2186
  • [40] Two approaches for the min-degree constrained minimum spanning tree problem
    Ghoshal, Sudishna
    Sundar, Shyam
    APPLIED SOFT COMPUTING, 2021, 111