Permutation Problems and Channelling Constraints

DOI10.1007/3-540-45653-8_26zbMath1273.68365OpenAlexW2154081061MaRDI QIDQ2996177

Toby Walsh

Publication date: 6 May 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45653-8_26

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

On the separability of subproblems in Benders decompositions ⋮ Global domain views for expressive and cross-domain constraint programming ⋮ Redundant modeling in permutation weighted constraint satisfaction problems ⋮ Automated reformulation of specifications by safe delay of constraints ⋮ Compiling problem specifications into SAT ⋮ Automatic generation of redundant models for permutation constraint satisfaction problems ⋮ SampleSearch: importance sampling in presence of determinism ⋮ Evaluating ASP and commercial solvers on the CSPLib ⋮ Exploiting functional dependencies in declarative problem specifications ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

This page was built for publication: Permutation Problems and Channelling Constraints