Solving the quorumcast routing problem by constraint programming
From MaRDI portal
Publication:487641
DOI10.1007/S10601-012-9125-ZzbMATH Open1309.90118OpenAlexW2034177370MaRDI QIDQ487641FDOQ487641
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
Recommendations
- Solving the quorumcast routing problem as a mixed integer program
- scientific article; zbMATH DE number 1535254
- A fast search algorithm for the quorumcast routing problem.
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Solving Connected Subgraph Problems in Wildlife Conservation
- A fast search algorithm for the quorumcast routing problem.
- Solving diameter-constrained minimum spanning tree problems by constraint programming
- The Minimum Spanning Tree Constraint
- The “Not-Too-Heavy Spanning Tree” Constraint
- Title not available (Why is that?)
- Title not available (Why is that?)
- Obtaining optimal k -cardinality trees fast
- An efficient algorithm for constructing delay bounded minimum cost multicast trees
Cited In (3)
This page was built for publication: Solving the quorumcast routing problem by constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487641)
