Learning value heuristics for constraint programming

DOI10.1007/978-3-319-18008-3_8MaRDI QIDQ5741460zbMATH OpenOpenAlexFDO

Authors Geoffrey Chu, Peter J. Stuckey

Publication date 25 July 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18008-3_8

Mathematics Subject Classification ID

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

Recommendations

• Learning in search
• scientific article; zbMATH DE number 2080312
• Advances in Artificial Intelligence – SBIA 2004
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
• Counting-based search: branching heuristics for constraint satisfaction problems

Cited in

(14)

• Progress towards the Holy Grail
• Value Prediction in Engineering Applications
• Learning in search
• DASH: dynamic approach for switching heuristics
• scientific article; zbMATH DE number 5141522 (Why is no real title available?)
• Evolving Variable-Ordering Heuristics for Constrained Optimisation
• Rapid learning for binary programs
• scientific article; zbMATH DE number 2080312 (Why is no real title available?)
• Advances in Artificial Intelligence – SBIA 2004
• Learning General Constraints in CSP
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
• Online learning of variable ordering heuristics for constraint optimisation problems
• Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver
• Domain-independent dynamic programming

This page was built for publication: Learning value heuristics for constraint programming

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