The tree Constraint

DOI10.1007/11493853_7zbMath1133.90403OpenAlexW1570763516MaRDI QIDQ5450922

Nicolas Beldiceanu, Pierre Flener, Xavier Lorca

Publication date: 17 March 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/11493853_7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (12)

On computing the 2-vertex-connected components of directed graphs ⋮ Strong articulation points and strong bridges in large scale graphs ⋮ Undirected forest constraints ⋮ Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ Global constraint catalogue: past, present and future ⋮ Finding strong bridges and strong articulation points in linear time ⋮ Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint ⋮ Improved filtering for weighted circuit constraints ⋮ Counting weighted spanning trees to solve constrained minimum spanning tree problems ⋮ The weighted arborescence constraint ⋮ Combining tree partitioning, precedence, and incomparability constraints ⋮ Explaining circuit propagation

This page was built for publication: The tree Constraint