How To Be Fickle

DOI10.1007/978-3-540-74456-6_1zbMATH Open1147.68706OpenAlexW1543397086MaRDI QIDQ3525550FDOQ3525550

Authors: Vašek Chvátal 

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_1

Recommendations

• Resolution search
• Resolution search and dynamic branch-and-bound
• Branching rules for satisfiability
• Accelerating backtrack search with a best-first-search strategy
• Branching rules revisited

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Uses Software

• Concorde

This page was built for publication: How To Be Fickle

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