A non-binary constraint ordering heuristic for constraint satisfaction problems

DOI10.1016/J.AMC.2007.08.064zbMATH Open1133.68434OpenAlexW2072638944MaRDI QIDQ2425983FDOQ2425983

Miguel A. Salido

Publication date: 17 April 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.08.064

zbMATH Keywords

heuristic searchconstrainednessnon-binary constraintsconstraint ordering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Sufficient Condition for Backtrack-Free Search
• Network-based heuristics for constraint-satisfaction problems
• On forward checking for non-binary constraint satisfaction.
• Backtrack programming techniques
• Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
• Distributed CSPs by graph partitioning
• Maintenance scheduling problems as benchmarks for constraint algorithms

Cited In (3)

• On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
• Subproblem ordering heuristics for AND/OR best-first search
• Title not available (Why is that?)

This page was built for publication: A non-binary constraint ordering heuristic for constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425983)