Relevant bibliographies by topics / Lin-Kernighan Algorithm

Contents

  1. Journal articles
  2. Book chapters
  3. Conference papers
  4. Reports

Academic literature on the topic 'Lin-Kernighan Algorithm'

Author: Grafiati
Published: 3 June 2025
Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lin-Kernighan Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Lin-Kernighan Algorithm"

1

Liu, Yu Zhong, and Hua Ping Yu. "A Dynamic Edge Exchanged Ant Colony Algorithm for TSP Problem." Applied Mechanics and Materials 687-691 (November 2014): 1608–11. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.1608.

Full text
Abstract:
Aimed at solving premature convergence and low speed in heuristic algorithms for TSP problems, this paper analyzed the principle of Max-Min Ant colony algorithm (MMAS) and Lin-Kernighan algorithm, then proposed a dynamic exchange of Max-Min Ant colony algorithm (MMAS-LK). The new algorithm used MMAS to initially a set of the solutions in the early state, then utilized the improved Lin-Kernighan algorithm for local optimization, and dynamic adjustment parameters according to the process of computing avoid falling into local optimum. The simulation results showed that the proposed algorithm comp
APA, Harvard, Vancouver, ISO, and other styles
2

Mann, Zoltán, András Orbán, and Viktor Farkas. "Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning." International Journal of Applied Mathematics and Computer Science 17, no. 2 (2007): 249–67. http://dx.doi.org/10.2478/v10006-007-0022-3.

Full text
Abstract:
Evaluating the Kernighan-Lin Heuristic for Hardware/Software PartitioningIn recent years, several heuristics have been proposed for the hardware/software partitioning problem. One of the most promising directions is the adaptation of the Kernighan-Lin algorithm. The Kernighan-Lin heuristic was originally developed for circuit partitioning, but it has been adapted to other domains as well. Moreover, numerous improvements have been suggested so that now several variants of the original algorithm exist. The aim of this paper is to systematically evaluate the possibilities of applying the Kernigha
APA, Harvard, Vancouver, ISO, and other styles
3

Crişan, Gloria Cerasela, Camelia-M. Pintea, Petrică C. Pop, and Oliviu Matei. "Economical connections between several European countries based on TSP data." Logic Journal of the IGPL 28, no. 1 (2019): 33–44. http://dx.doi.org/10.1093/jigpal/jzz069.

Full text
Abstract:
Abstract A fluent economical collaboration between countries is a major need. European flows of trade and people are supported by efficient connections between main localities from a geographic region, in many cases overriding national borders. This paper introduces three traveling salesmen problem instances based on freely available geographic coordinates of the main cities of France, Portugal and Spain. These instances are unified, generating other four larger instances: three with all pairs of countries and one instance with the settlements from all the three countries. The study includes a
APA, Harvard, Vancouver, ISO, and other styles
4

Chua, C. B., and Kan Chen. "Learning Algorithm for the Uniform Graph Partitioning Problem." International Journal of Modern Physics C 09, no. 02 (1998): 331–39. http://dx.doi.org/10.1142/s012918319800025x.

Full text
Abstract:
We study the uniform graph partitioning problem using the learning algorithm proposed by one of us. We discuss the characteristics of the learning algorithm and compare the performance of the algorithm empirically with the Kernighan–Lin algorithm on a range of instances. Even with a simple implementation, the learning algorithm is capable of producing very good results.
APA, Harvard, Vancouver, ISO, and other styles
5

De Carvalho, Emerson Bezerra, Elizabeth Ferreira Gouvêa Goldbarg, and Marco Cesar Goldbarg. "A Multi-objective Version of the Lin-Kernighan Heuristic for the Traveling Salesman Problem." Revista de Informática Teórica e Aplicada 25, no. 1 (2018): 48. http://dx.doi.org/10.22456/2175-2745.76452.

Full text
Abstract:
The Lin and Kernighan’s algorithm for the single objective Traveling Salesman Problem (TSP) is one of the most efficient heuristics for the symmetric case. Although many algorithms for the TSP were extended to the multi-objective version of the problem (MTSP), the Lin and Kernighan’s algorithm was still not fully explored. Works that applied the Lin and Kernighan’s algorithm for the MTSP were driven to weighted sum versions of the problem. We investigate the LK from a Pareto dominance perspective. The multi-objective LK was implemented within two local search schemes and applied to 2 to 4-obje
APA, Harvard, Vancouver, ISO, and other styles
6

WANG, Dong, Ya LI, Chen WU, and Dong-mei LIN. "New strategy for improving performance of chained Lin-Kernighan algorithm." Journal of Computer Applications 32, no. 2 (2013): 425–27. http://dx.doi.org/10.3724/sp.j.1087.2012.00425.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ezhilarasi, G. A., and K. S. Swarup. "Network decomposition using Kernighan–Lin strategy aided harmony search algorithm." Swarm and Evolutionary Computation 7 (December 2012): 1–6. http://dx.doi.org/10.1016/j.swevo.2012.07.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ulyanov, M. V., and M. I. Fomichev. "Research of Features of the Combined Algorithm for Solving the Asymmetric Traveling Salesman Problem." INFORMACIONNYE TEHNOLOGII 27, no. 1 (2021): 3–8. http://dx.doi.org/10.17587/it.27.3-8.

Full text
Abstract:
The exact algorithm that implements the Branch and Boimd method with precomputed tour which is calculated by Lin-Kernighan-Helsgaun metaheuristic algorithm for solving the Traveling Salesman Problem is concerned here. Reducing the number of decision tree nodes, which are created by the Branches and Bound method, due to a "good" precomputed tour leads to the classical balancing dilemma of time costs. A tour that is close to optimal one takes time, even when the Lin-Kernighan-Helsgaun algorithm is used, however it reduces the working time of the Branch and Bound method. The problem of determinin
APA, Harvard, Vancouver, ISO, and other styles
9

郁, 湧. "Research on the Improvement of Kernighan-Lin Algorithm for Graph Partitioning." Computer Science and Application 09, no. 05 (2019): 849–54. http://dx.doi.org/10.12677/csa.2019.95095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Shi Gang, Yu Juan Wang, Guan Xiong Wu, and Yi Li Fu. "Application of Intelligence Fusion Algorithm in Path Optimization Problem." Applied Mechanics and Materials 151 (January 2012): 632–36. http://dx.doi.org/10.4028/www.scientific.net/amm.151.632.

Full text
Abstract:
In CAD/CAM integration system, the problem of the path optimization to be thorough researched. Through numerical describe of information elements, by using graph theory of traveling salesman problem，set up the mathematical model of path optimization problem. Based on ant colony algorithm and lin-kernighan (LK) algorithm, an intelligence fusion algorithm is put forward. With group of holes processing as an example, the group of holes drilling tool path of optimized, and realize the CAD/CAM many features of optimization, which greatly improve the processing precision and efficiency.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Lin-Kernighan Algorithm"

1

Patil, Siddheshwar V., and Dinesh B. Kulkarni. "Graph Partitioning Using Heuristic Kernighan-Lin Algorithm for Parallel Computing." In Advances in Intelligent Systems and Computing. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-4851-2_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Boufar, Tarek, Omar Rifki, and Matthieu Basseur. "Diversification Through Candidate Sampling for a Non-iterated Lin-Kernighan-Helsgaun Algorithm." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-86849-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weihong, Yao, Yang Yuehui, and Tan Guozhen. "Recursive Kernighan-Lin Algorithm (RKL) Scheme for Cooperative Road-Side Units in Vehicular Networks." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-53962-6_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Motohashi, Shun, Takafumi Matsuura, Tohru Ikeguchi, and Kazuyuki Aihara. "The Lin-Kernighan Algorithm Driven by Chaotic Neurodynamics for Large Scale Traveling Salesman Problems." In Artificial Neural Networks – ICANN 2009. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04277-5_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Hong, and Xiaojun Wang. "KGT: An Application Mapping Algorithm Based on Kernighan–Lin Partition and Genetic Algorithm for WK-Recursive NoC Architecture." In Intelligent Computing Theories and Application. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-84522-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, XiaoJun, Feng Shi, and Hong Zhang. "KLSAT: An Application Mapping Algorithm Based on Kernighan–Lin Partition and Simulated Annealing for a Specific WK-Recursive NoC Architecture." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30709-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kiruthika, R., and M. S. Vijaya. "Community Detection Using Girvan–Newman and Kernighan–Lin Bipartition Algorithms." In Data Intelligence and Cognitive Informatics. Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-6460-1_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Greene, William A. "A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms." In Genetic and Evolutionary Computation — GECCO 2003. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45110-2_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Lin-Kernighan Algorithm"

1

Rajan, Archana K., and Deepika Bhaiya. "VLSI partitioning using parallel kernighan lin algorithm." In 2017 International Conference on Communication and Signal Processing (ICCSP). IEEE, 2017. http://dx.doi.org/10.1109/iccsp.2017.8286727.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bonny, Talal, and Joerg Henkel. "Using Lin-Kernighan algorithm for look-up table compression to improve code density." In the 16th ACM Great Lakes symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1127908.1127969.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sun, Jian, Yuting Wang, Junqing Li, and Kaizhou Gao. "Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem." In 2011 Seventh International Conference on Natural Computation (ICNC). IEEE, 2011. http://dx.doi.org/10.1109/icnc.2011.6022378.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bui, T., C. Heigham, C. Jones, and T. Leighton. "Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms." In the 1989 26th ACM/IEEE conference. ACM Press, 1989. http://dx.doi.org/10.1145/74382.74527.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Lin-Kernighan Algorithm"

1

Bui, Thang, Christopher Heigham, Curt Jones, and Tom Leighton. Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada211914.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Lin-Kernighan Algorithm' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography