The Relation Between Complete and Incomplete Search

DOI10.1007/978-3-540-78295-7_3zbMath1415.90047OpenAlexW1526877743MaRDI QIDQ2950519

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 propagationconstraint satisfactionconstraint programming

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ Unnamed Item

Uses Software

• DIMACS

Cites Work

• Density condensation of Boolean formulas
• Partitioning procedures for solving mixed-variables programming problems
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Nonsystematic search and no-good learning
• Local search with constraint propagation and conflict-based heuristics
• Negative effects of modeling techniques on search performance
• Hybrid evolutionary algorithms for graph coloring
• Implementing the Davis-Putnam method
• Exploiting relaxation in local search for LABS
• Random backtracking in backtrack search algorithms for satisfiability
• A Search-Infer-and-Relax Framework for Integrating Solution Methods
• Symmetry Breaking and Local Search Spaces
• Local Search for Unsatisfiability
• Principles and Practice of Constraint Programming – CP 2003
• Exploiting symmetries within constraint satisfaction search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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