A decomposition-based implementation of search strategies

DOI10.1145/976706.976714MaRDI QIDQ5277701zbMATH OpenOpenAlexFDO

Authors Laurent Michel, Pascal Van Hentenryck

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/976706.976714

zbMATH Keywords

combinatorial optimizationconstraint programmingsearch

Mathematics Subject Classification ID

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

Recommendations

• Parallel depth-bounded discrepancy search
• YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
• Limited discrepancy search revisited
• Principles and Practice of Constraint Programming – CP 2004
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search

Cited in

(8)

• Standard directed search strategies and their applications
• A unified framework for partial and hybrid search methods in constraint programming
• scientific article; zbMATH DE number 6481541 (Why is no real title available?)
• YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
• Batched dynamic solutions to decomposable searching problems
• Parallel depth-bounded discrepancy search
• Principles and Practice of Constraint Programming – CP 2004
• Control abstractions for local search

Describes a project that uses

Uses Software

• OPL
• SALSA

This page was built for publication: A decomposition-based implementation of search strategies

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