The Kernighan-Lin Search Algorithm
Explore this paper's citation graph
Summary
This paper expresses a problem-agnostic mechanism, called variable depth search, as part of a general search algorithm, called the Kernighan-Lin Search algorithm, to facilitate its use beyond the TSP and GPP problems.
- Type
- preprint
- Published
- 2025-02-01
- Cited by
- 0
- References
- 30
- Access
- Open access
- OpenAlex
- https://openalex.org/W4407123450
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:276094663
Keywords
Computer science, Algorithm
References
- A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem
- A connectionist machine for genetic hillclimbing
- A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization
- Iterated Local Search
- Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
- Tabu Search Applied to the Quadratic Assignment Problem
- On the complexity of local search
- Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems
- AN EXPERIMENTAL STUDY OF VARIABLE DEPTH SEARCH ALGORITHMS FOR THE QUADRATIC ASSIGNMENT PROBLEM
- How Easy is Local Search?
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- A survey of very large-scale neighborhood search techniques
- Genetic Algorithms in Search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- An efficient heuristic procedure for partitioning graphs
- Handbook of Heuristics
- A variable depth approach for the single-vehicle pickup and delivery problem with time windows
- Genetic Synthesis of Unsupervised Learning Algorithms
- A History of Metaheuristics
- An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems
Cited by
No citing papers recorded for this paper.
Related papers
- ИСПОЛЬЗОВAНИЕ ПОТЕНЦИAЛA СОЦИAЛЬНЫХ ПAРТНЕРОВ В ПОДГОТОВКЕ БУДУЩИХ ПЕДAГОГОВ
- DETERMINING QUALITY REQUIREMENTS AT THE UNIVERSITIES TO IMPROVE THE QUALITY OF EDUCATION
- Remarks on Algorithm 2, Algorithm 3, Algorithm 15, Algorithm 25 and Algorithm 26
- Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance
- Using DataGrid Control to Realize DataBase of Querying in VB6.0
- ESKVS: efficient and secure approach for keyframes-based video summarization framework
- Study and Two Types of Typical Usage of DataGrid Web Server Control
- STKVS: secure technique for keyframes-based video summarization model