The Relation Between Complete and Incomplete Search

DOI10.1007/978-3-540-78295-7_3MaRDI QIDQ2950519zbMATH OpenOpenAlexFDO

Authors Steven Prestwich

Publication date 9 October 2015

Published in Hybrid Metaheuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78295-7_3

zbMATH Keywords

local searchconstraint programmingconstraint satisfactionconstraint propagation

Mathematics Subject Classification ID

Search theory (90B40) Mathematical programming (90C99)

Recommendations

• In search of the sources of incompleteness
• Optimization of partial search
• Relative completeness
• scientific article; zbMATH DE number 4131939
• Relative completions
• scientific article; zbMATH DE number 742968
• scientific article; zbMATH DE number 193887
• Quest for fast partial search algorithm

Cites work

• scientific article; zbMATH DE number 5139172 (Why is no real title available?)
• scientific article; zbMATH DE number 1305705 (Why is no real title available?)
• scientific article; zbMATH DE number 1149402 (Why is no real title available?)
• scientific article; zbMATH DE number 2080317 (Why is no real title available?)
• scientific article; zbMATH DE number 2080328 (Why is no real title available?)
• scientific article; zbMATH DE number 2084698 (Why is no real title available?)
• scientific article; zbMATH DE number 2084740 (Why is no real title available?)
• scientific article; zbMATH DE number 1487977 (Why is no real title available?)
• scientific article; zbMATH DE number 956844 (Why is no real title available?)
• A Search-Infer-and-Relax Framework for Integrating Solution Methods
• Density condensation of Boolean formulas
• Exploiting relaxation in local search for LABS
• Exploiting symmetries within constraint satisfaction search
• Hybrid evolutionary algorithms for graph coloring
• Implementing the Davis-Putnam method
• Local Search for Unsatisfiability
• Local search with constraint propagation and conflict-based heuristics
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Negative effects of modeling techniques on search performance
• Nonsystematic search and no-good learning
• Partitioning procedures for solving mixed-variables programming problems
• Random backtracking in backtrack search algorithms for satisfiability
• Solution-guided multi-point constructive search for job shop scheduling
• Symmetry Breaking and Local Search Spaces
• Using stochastic local search to solve quantified Boolean formulae

Cited in

(4)

• Generalized Nets as a Tool for the Modelling of Data Mining Processes
• Combining incomplete search and clause generation: an application to the orienteering problems with time windows
• scientific article; zbMATH DE number 7306863 (Why is no real title available?)
• Sure success partial search

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: The Relation Between Complete and Incomplete Search

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