Identifying and exploiting problem structures using explanation-based constraint programming

DOI10.1007/s10601-006-9002-8zbMath1117.90075OpenAlexW2082285170MaRDI QIDQ857888

Hadrien Cambazard, Narendra Jussien

Publication date: 5 January 2007

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-006-9002-8

zbMATH Keywords

structuresexplanationssearch heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Learning cluster-based structure to solve constraint satisfaction problems ⋮ Value ordering for quantified CSPs ⋮ Explanation-based large neighborhood search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Radio link frequency assignment
• Logic-based Benders decomposition
• Local search with constraint propagation and conflict-based heuristics
• Generalized Benders decomposition
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Integrating Benders Decomposition Within Constraint Programming
• Determining computational complexity from characteristic ‘phase transitions’
• Inductive Logic Programming
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Random constraint satisfaction: A more accurate picture

This page was built for publication: Identifying and exploiting problem structures using explanation-based constraint programming