The asymptotic convergence of C.-J. Lin (2001) can be applied to a modified SMO (sequential minimal optimization) algorithm by S.S. Keerthi et al. (2001) with some assumptions. The author shows that for this algorithm those assumptions are not necessary.

This paper presents the Voronoi-clip (V-clip) algorithm for polyhedral collision detection. The method is similar to that of the Lin-Canny algorithm [1] in that it tracks the closest pair of features between two polyhedra. However, the V-clip method offers superior robustness, requires less complex code, can better handle penetrating polyhedra, and is more useful for collision detection between...

The Traveling Salesman Problem (TSP) is a well-known optimization problem with many real-world applications [4]. In this problem, one tries to find a minimal-cost tour visiting each of the given cities exactly once. Since the TSP is NP-hard, much research has concentrated on finding good approximate solutions. One class of heuristic algorithms is local search, which has been routinely applied t...

The multilevel paradigm has recently been applied to the travelling salesman problem with considerable success. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs a local search algorithm to refine the solution on each of the coarsened problems in reverse order. In the original version the chained Lin-Kernighan (CLK) scheme was used for the refinemen...

In this paper, the Maximal Size Matching with Permanent Selection (MSMPS) scheduling algorithm and its performance evaluation, under different traffic models, are described. In this article, computer simulation results under nonuniformly, diagonally and lin-diagonally distributed traffic models are presented. The simulations was performed for different switch sizes: 4×4, 8×8 and 16×16. Results ...

The state-of-the-art of local search heuristics for the traveling salesman problem (TSP) is chiefly based on algorithms using the classical Lin–Kernighan (LK) procedure and the stem-and-cycle (S&C) ejection chain method. Critical aspects of implementing these algorithms efficiently and effectively rely on taking advantage of special data structures and on maintaining appropriate candidate lists...

KEY: # = new course * = course changed † = course dropped University of Kentucky 2015-2016 Undergraduate Bulletin 1 LIN 209 THE STRUCTURE AND USE OF ENGLISH. (3) A general survey of the history, structure, and use of the English language. Topics investigated include: the history of the English language; elements of the structure of English; the distinctive characteristics of spoken and written ...

Multilevel algorithms are a successful class of optimisation techniqueswhich address themeshpartitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement of the technique which uses imbalance to achieve higher quality partitions. We also present a formula...

We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling s...

The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. Al...