The Weighted Spanning Tree Constraint Revisited
From MaRDI portal
Publication:3569939
DOI10.1007/978-3-642-13520-0_31zbMath1285.68162OpenAlexW1484903242MaRDI QIDQ3569939
Michel Rueher, Jean-Charles Régin, Louis-Martin Rousseau, Willem-Jan van Hoeve
Publication date: 22 June 2010
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_31
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
The salesman and the tree: the importance of search in CP ⋮ Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks ⋮ Improved filtering for weighted circuit constraints ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ Counting weighted spanning trees to solve constrained minimum spanning tree problems ⋮ The weighted arborescence constraint
This page was built for publication: The Weighted Spanning Tree Constraint Revisited
