Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming

DOI10.1007/11493853_9MaRDI QIDQ5450924zbMATH OpenOpenAlexFDO

Authors Hadrien Cambazard, Narendra Jussien

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_9

Mathematics Subject Classification ID

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

Recommendations

• Identifying and exploiting problem structures using explanation-based constraint programming
• scientific article; zbMATH DE number 2084736
• A framework for step-wise explaining how to solve constraint satisfaction problems
• scientific article; zbMATH DE number 7368415
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Artificial Intelligence: Methodology, Systems, and Applications

Cited in

(6)

• Constraint programming and operations research
• A decomposition approach for solving a broadcast domination network design problem
• Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
• scientific article; zbMATH DE number 7368415 (Why is no real title available?)
• Principles and Practice of Constraint Programming – CP 2004
• Identifying and exploiting problem structures using explanation-based constraint programming

This page was built for publication: Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming

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