Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint

DOI10.1007/978-3-540-68155-7_19zbMath1142.68523OpenAlexW1861815471MaRDI QIDQ5387633

Jean-Charles Régin

Publication date: 27 May 2008

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-540-68155-7_19

Mathematics Subject Classification ID

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 ⋮ Improved filtering for weighted circuit constraints ⋮ Solving the quorumcast routing problem by constraint programming ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Fast Algorithms for Finding Nearest Common Ancestors
• Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
• The “Not-Too-Heavy Spanning Tree” Constraint
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
• On Finding Lowest Common Ancestors in Trees
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• The tree Constraint
• Lowest common ancestors in trees and directed acyclic graphs

This page was built for publication: Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint