An enhancement scheme for constraint satisfaction problems (CSPs)

DOI10.1080/00207169308804174zbMATH Open0813.68151OpenAlexW2022167487WikidataQ126244478 ScholiaQ126244478MaRDI QIDQ4323391FDOQ4323391

Authors:

Publication date: 28 May 1995

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169308804174

Recommendations

• Dynamic variable ordering in graph based backjumping algorithms for csps
• Conflict-directed backjumping revisited
• Backjump-based backtracking for constraint satisfaction problems
• PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking
• A theoretical evaluation of selected backtracking algorithms.

zbMATH Keywords

constraint satisfaction problemsbacktracking algorithmbackjumping

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• A CSP search algorithm with responsibility sets and kernels
• Principles and Practice of Constraint Programming – CP 2004
• Constraint answer set solver EZCSP and why integration schemas matter
• Metaheuristics: A bibliography
• Improving the Held and Karp Approach with Constraint Programming

This page was built for publication: An enhancement scheme for constraint satisfaction problems (CSPs)

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