Solving the quorumcast routing problem by constraint programming

DOI10.1007/S10601-012-9125-ZzbMath1309.90118OpenAlexW2034177370MaRDI QIDQ487641

Quang Dung Pham, Yves Deville

Publication date: 22 January 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-012-9125-z

zbMATH Keywords

graphsconstraint programmingconstrained optimum treesincomplete searchquorumcast routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for constructing delay bounded minimum cost multicast trees
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• A fast search algorithm for the quorumcast routing problem.
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• The Minimum Spanning Tree Constraint
• Solving Connected Subgraph Problems in Wildlife Conservation
• The “Not-Too-Heavy Spanning Tree” Constraint
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• Obtaining optimal k -cardinality trees fast

This page was built for publication: Solving the quorumcast routing problem by constraint programming