Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,378,812 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.
Highly Cited
2014
Highly Cited
2014
Large-scale multiuser SM-MIMO versus massive MIMO
T. L. Narasimhan
,
P. Raviteja
,
A. Chockalingam
Information Theory and Applications Workshop
2014
Corpus ID: 4965984
Spatial modulation (SM) is attractive for multi-antenna wireless communications. SM uses multiple transmit antenna elements but…
Expand
Highly Cited
2011
Highly Cited
2011
Algorithm and Architecture Co-Design of Hardware-Oriented, Modified Diamond Search for Fast Motion Estimation in H.264/AVC
O. Ndili
,
T. Ogunfunmi
IEEE transactions on circuits and systems for…
2011
Corpus ID: 26376885
In this paper, we present a new hardware-oriented, modified diamond search (HMDS) algorithm, for fast integer pel, motion…
Expand
2011
2011
Modified extremal optimization for the hard maximum satisfiability problem
Guo-qiang Zeng
,
Yongzai Lu
,
Weijie Mao
Journal of Zhejiang University SCIENCE C
2011
Corpus ID: 22438266
Based on our recent study on probability distributions for evolution in extremal optimization (EO), we propose a modified…
Expand
Highly Cited
2007
Highly Cited
2007
Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem
S. Abdullah
,
E. Burke
,
B. McCollum
Metaheuristics
2007
Corpus ID: 16897251
The course timetabling problem deals with the assignment of a set of courses to specific timeslots and rooms within a working…
Expand
Highly Cited
2007
Highly Cited
2007
A scatter search-based heuristic to locate capacitated transshipment points
B. Keskin
,
H. Üster
Computers & Operations Research
2007
Corpus ID: 31532330
Highly Cited
2003
Highly Cited
2003
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
A. Shmygelska
,
H. Hoos
Canadian Conference on AI
2003
Corpus ID: 9759455
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational…
Expand
Highly Cited
2000
Highly Cited
2000
The new model of parallel genetic algorithm in multi-objective optimization problems - divided range multi-objective genetic algorithm
T. Hiroyasu
,
M. Miki
,
S. Watanabe
Proceedings of the Congress on Evolutionary…
2000
Corpus ID: 18222090
Proposes a divided-range multi-objective genetic algorithm (DRMOGA), which is a model for the parallel processing of genetic…
Expand
Highly Cited
1997
Highly Cited
1997
An elliptical head tracker
Stan Birchfield
Conference Record of the Thirty-First Asilomar…
1997
Corpus ID: 5548179
A simple algorithm for tracking a person's head is presented. A two-dimensional model, namely an ellipse, is used to approximate…
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
Highly Cited
1987
Highly Cited
1987
Heuristic methods for flexible flow line scheduling
S. Kochhar
,
R. Morris
1987
Corpus ID: 62519905
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)
ACCEPT & CONTINUE