Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,161,658 papers from all fields of science
Search
Sign In
Create Free Account
Local search (optimization)
Known as:
Local search algorithm
, K-opt
, K-Opt method
Expand
In computer science, local search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
3-opt
Algorithm
Anytime algorithm
Approximation algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem
Samadhi Nallaperuma
,
Markus Wagner
,
Frank Neumann
,
B. Bischl
,
Olaf Mersmann
,
H. Trautmann
FOGA XII '13
2013
Corpus ID: 4991990
Understanding the behaviour of well-known algorithms for classical NP-hard optimisation problems is still a difficult task. With…
Expand
2008
2008
Solving constrained engineering optimization problems by the constrained PSO-DD
Chukiat Worasucheep
International Conference on Electrical…
2008
Corpus ID: 15231109
Many real world engineering optimization problems are nonlinear and constrained, meaning that objective functions are to be…
Expand
2007
2007
The University Course Timetabling Problem with a 3-phase approach
P. Kostuch
2007
Corpus ID: 15933915
This paper describes the University Course Timetabling Problem (UCTP) used in the International Timetabling Competition 2003…
Expand
Highly Cited
2007
Highly Cited
2007
A New Local Search Algorithm for the DNA Fragment Assembly Problem
E. Alba
,
Gabriel Luque
EvoCOP
2007
Corpus ID: 30638729
In this paper we propose and study the behavior of a new heuristic algorithm for the DNA fragment assembly problem: PALS. The DNA…
Expand
2004
2004
A Memetic Algorithm for Protein Structure Prediction in a 3D-Lattice HP Model
A. Bazzoli
,
A. Tettamanzi
EvoWorkshops
2004
Corpus ID: 16295497
This paper presents a memetic algorithm with self-adaptive local search, applied to protein structure prediction in an HP, cubic…
Expand
Highly Cited
2003
Highly Cited
2003
On the deployment of picocellular wireless infrastructure
M. Unbehaun
,
M. Kamenetsky
IEEE wireless communications
2003
Corpus ID: 206490131
Wireless LANs are becoming increasingly common in both home and office networks. Additionally, wireless Internet service…
Expand
Review
2003
Review
2003
PROPERTIES OF NONUNIFORM RANDOM GRAPH MODELS
Satu Virtanen
2003
Corpus ID: 116394906
This is a survey on network models designed to produce graphs that resemble natural networks. Unlike artificially generated…
Expand
2000
2000
Too busy to learn [individual learning interaction with evolutionary algorithm in Busy Beaver problem]
F. B. Pereira
,
Penousal Machado
,
+4 authors
Marta Soto
Proceedings of the Congress on Evolutionary…
2000
Corpus ID: 5582105
The goal of this research is to analyze how individual learning interacts with an evolutionary algorithm in its search for best…
Expand
Highly Cited
1997
Highly Cited
1997
Implementation and Computational Results
N. Tönshoff
1997
Corpus ID: 117054657
In the literature (see, e.g. Bertsimas and Tsitsiklis [1994], Chvatal [1983] and Garfinkel and Nemhauser [1972]), a number of…
Expand
Review
1996
Review
1996
An Approach to Resource Constrained Project Scheduling
J. Crawford
1996
Corpus ID: 271981
This paper gives an overview of a new approach to Resource Constrained Project Scheduling. The approach is based on the…
Expand