Local search

Known as: K-Opt method, K-opt, Local search algorithm 
In computer science, local search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2018
020040060019732018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and e€ective metaheuristic… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Many communication and social networks have power-law link distributions, containing a few nodes that have a very high degree and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper develops a framework for optimizing global-local hybrids of search or optimization procedures. The paper starts by… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Guided Local Search (GLS) is an intelligent search scheme for combinatorial optimization problems. A main feature of the approach… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper presents a probabilistic technique to diversify, intensify and parallelize a local search adapted for solving vehicle… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
It has recently been shown that local search is sur prisingly good at nding satisfying assignments for certain computationally… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We introduce a meta-heuristic to combine simulated annealing with local search methods for CO problems. This new class of Markov… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
One of the few general approaches to difficult combinatorial optimization problems that has met with empirical success is local… (More)
Is this relevant?