Solving the quorumcast routing problem as a mixed integer program

Bui, Quoc Trung;Pham, Quang Dung;Deville, Yves
(2014) 11th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2014) — Location: Cork, Ireland (19.May.2014)

Files

cpaior2014_QRP.pdf
  • Open Access
  • Adobe PDF
  • 465.11 KB
Download

Details

Authors
  • Bui, Quoc TrungUCLouvain
    Author
  • Pham, Quang DungUCLouvain
    Author
  • Deville, Yvesorcid-logoUCLouvain
    Author
Abstract
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
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Bui, Q. T., Pham, Q. D., & Deville, Y. (2014). Solving the quorumcast routing problem as a mixed integer program. 11th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2014), Cork, Ireland. https://hdl.handle.net/2078.5/253739