Skip to search formSkip to main contentSkip to account menu

Local search (constraint satisfaction)

Known as: Local search 
In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. It is based on iteratively improving an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Boolean satisfiability problemComet (programming language)Conjunctive normal formConstraint satisfaction

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Experiments in Parallel Constraint-Based Local Search
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on… 
2010
2010
Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems
2010
2010
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings
2009
2009
Pipelining Memetic Algorithms, Constraint Satisfaction, and Local Search for Course Timetabling
This paper introduces a hybrid algorithm that combines local search and constraint satisfaction techniques with memetic… 
2009
2009
Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP
Abstract In this paper, a new modified version of Greedy Randomized Adaptive Search Procedure (GRASP), called Multiple Phase… 
2004
2004
Meta-heuristics for robust graph coloring problem
In This work, the robust graph coloring problem (RGCP), an extension of the classical graph coloring, is solved by various meta… 
2003
2003
Cutting Angle Method and a Local Search
The paper deals with combinations of the cutting angle method in global optimization and a local search. We propose to use… 
1999
1999
Applying Local Search to Structural Constraint Satisfaction
Alexander Nareyek GMD | FIRST German National Research Center for Information Technology Research Institute for Computer… 
1996
1996
Combining Local Search and Backtracking Techniques for Constraint Satisfaction
Backtracking techniques are well-known traditional methods for solving many constraint satisfaction problems (CSPs), including… 
Highly Cited
1996
Highly Cited
1996
A View of Local Search in Constraint Programming
We propose in this paper a novel way of looking at local search algorithms for combinatorial optimization problems which better… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)