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… (More)
Wikipedia

Related topics

Related topics

8 relations
Boolean satisfiability problemConjunctive normal formConstraint satisfactionConstraint satisfaction problem
(More)

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Constraint-Based Local Search
We may not be able to make you love reading, but constraint based local search will lead you to love reading starting from now… (More)
Is this relevant?
2002
2002
Reducing Search Space in Local Search for Constraint Satisfaction
Typically local search methods for solving constraint satisfaction problems such as GSAT, WalkSAT and DLM treat the problem as an… (More)
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Enhancing Timetable Solutions with Local Search Methods
It is well known that domain-specific heuristics can produce good-quality solutions for timetabling problems in a short amount of… (More)
  • figure 1
  • table 1
  • figure 4
  • figure 5
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Yet Another Local Search Method for Constraint Solving
We here propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Local Search with Constraint Propagation and Conflict-Based Heuristics
Search algorithms for solvingCSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
1999
1999
Applying Local Search to Structural Constraint Satisfaction
Alexander Nareyek GMD | FIRST German National Research Center for Information Technology Research Institute for Computer… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Guided local search and its application to the traveling salesman problem
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. In this paper, we are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
When Gravity Fails: Local Search Topology
Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to… (More)
  • figure 3
  • figure 4
  • figure 7
  • figure 8
  • figure 10
Is this relevant?
1996
1996
Partial Constraint Satisfaction Problems and Guided Local Search
A largely unexplored aspect of Constraint Satisfaction Problem (CSP) is that of over-constrained instances for which no solution… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?