Kernighan–Lin algorithm

Known as: Kernighan-Lin, Kernighan–Lin, Kernighan–Lin heuristic

Kernighan–Lin is a O(n2 log(n)) heuristic algorithm for solving the graph partitioning problem. The algorithm has important applications in the…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

This paper compares the performances of the African Buffalo Optimization (ABO), hybrid Honey Bee Mating Optimization (HBMO) and…

2016

A parallel approach for solving a large-scale Traveling Salesman Problem (TSP) is presented. The problem is solved in four stages…

2015

*El presente manuscrito, con modificaciones, representa el trabajo de investigación para obtener la especialización y residencia…

2014

Studied is a kind of NH3/CO2 two-stage low temperature refrigeration system, in which NH3 is used as the refrigerant in the high…

2011

The Clustered Traveling Salesman Problem (CTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities…

2009

Contour Crafting is an emerging technology that uses robotics to construct free form structures by repeatedly laying down layers…

2004

The Nested Partition algorithm suffers from the lack of information gathering and sharing despite the computational effort…

2003

This paper presents a newly implemented parallel finite element procedure for contact-impact problems. Three sub-algorithms are…

2003

In this paper we present a multilevel ant-colony optimization algo- rithm, which is a relatively new metaheuristic technique for…

2001

If the promise of computational modeling is to be fully realized in higher-level cognitive domains such as language processing…