Solving the Quorumcast Routing Problem as a Mixed Integer Program

The quorumcast routing problem is a generalization of multicasting which arises in many distributed applications. It consists of finding a minimum cost tree that spans the source node and at least q out of m specified nodes on a given undirected weighted graph. In this paper, we solve this problem as a mixed integer program. The experimental results show that our four approaches outperform the state of the art. A sensitivity analysis is also performed on values of q and m.

[1]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[2]  Tetsuya Fujie,et al.  The maximum‐leaf spanning tree problem: Formulations and facets , 2004, Networks.

[3]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[5]  Yves Deville,et al.  Solving the quorumcast routing problem by constraint programming , 2012, Constraints.

[6]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[7]  Mikael Lind,et al.  On bicriterion minimal spanning trees: An approximation , 1996, Comput. Oper. Res..

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[9]  Eduardo Uchoa,et al.  Reduction tests for the prize-collecting Steiner problem , 2006, Oper. Res. Lett..

[10]  Danny H. K. Tsang,et al.  Quorumcast routing by multispace search , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[11]  T. Koch,et al.  SteinLib: An Updated Library on Steiner Tree Problems in Graphs , 2001 .

[12]  L. Wolsey,et al.  Chapter 9 Optimal trees , 1995 .

[13]  Stefan Irnich,et al.  Solving elementary shortest-path problems as mixed-integer programs , 2014, OR Spectr..

[14]  Bin Wang,et al.  An efficient QoS routing algorithm for quorumcast communication , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[15]  Thorsten Koch,et al.  Solving Steiner tree problems in graphs to optimality , 1998, Networks.

[16]  Sebastian Tobias Henn.  Weight-Constrained Minimum Spanning Tree Problem , 2007 .

[17]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[18]  Cristina Requejo,et al.  Formulations for the Weight‐Constrained Minimum Spanning Tree Problem , 2010 .

[19]  Sunil Chopra,et al.  Polyhedral Approaches for the Steiner Tree Problem on Graphs , 2001 .

[20]  Alysson M. Costa,et al.  Steiner Tree Problems With Profits , 2006 .

[21]  Akhil Kumar,et al.  Efficient quorumcast routing algorithms , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[22]  P. Bhave,et al.  Integer programming formulations of vehicle routing problems , 1985 .

[23]  Chor Ping Low.  A Fast Search Algorithm for the Quorumcast Routing Problem , 1998, Inf. Process. Lett..

[24]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[25]  Abilio Lucena,et al.  Reformulations and solution algorithms for the maximum leaf spanning tree problem , 2010, Comput. Manag. Sci..

[26]  Markus Chimani,et al.  Obtaining optimal k-cardinality trees fast , 2008, JEAL.

[27]  Abilio Lucena,et al.  A Branch and Cut Algorithm for the Steiner Problem in Graphs , 1998 .

[28]  Michel X. Goemans,et al.  A catalog of steiner tree formulations , 1993, Networks.

[29]  Markus Chimani,et al.  Obtaining Optimal k-Cardinality Trees Fast , 2008, ALENEX.

[30]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[31]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[32]  Michel Minoux,et al.  A strong flow-based formulation for the shortest path problem in digraphs with negative cycles , 2009, Int. Trans. Oper. Res..