Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms

DOI10.1007/978-3-642-38171-3_5zbMath1382.68222OpenAlexW197567181MaRDI QIDQ4922904

Philippe Jégou, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini

Publication date: 4 June 2013

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-38171-3_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

A hybrid tractable class for non-binary CSPs ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ On a new extension of BTP for binary CSPs ⋮ Variable and value elimination in binary constraint satisfaction via forbidden patterns

This page was built for publication: Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms