Welcome![Sign In][Sign Up]
Location:
Downloads SourceCode Mathimatics-Numerical algorithms Algorithm
Title: LKH-2.0.2 Download
 Description: K Helsgaun s Lin-kernighan heuristic implementation for traveling salesman problems, one of the best TSP solver. Pure C implementation.
 Downloaders recently: [More information of uploader Liu]
 To Search:
File list (Check if you may need any files):
 

LKH-2.0.2
.........\DOC
.........\...\LKH-2.0_PARAMETERS.pdf
.........\...\LKH-2.0_USER_GUIDE.pdf
.........\...\LKH_REPORT.pdf
.........\...\TSPLIB_DOC.pdf
.........\Makefile
.........\pr2392.par
.........\pr2392.tsp
.........\README
.........\SRC
.........\...\Activate.c
.........\...\AddCandidate.c
.........\...\AddExtraCandidates.c
.........\...\AddTourCandidates.c
.........\...\AdjustCandidateSet.c
.........\...\AllocateStructures.c
.........\...\Ascent.c
.........\...\Best2OptMove.c
.........\...\Best3OptMove.c
.........\...\Best4OptMove.c
.........\...\Best5OptMove.c
.........\...\BestKOptMove.c
.........\...\Between.c
.........\...\Between_SL.c
.........\...\Between_SSL.c
.........\...\BridgeGain.c
.........\...\BuildKDTree.c
.........\...\C.c
.........\...\CandidateReport.c
.........\...\ChooseInitialTour.c
.........\...\Connect.c
.........\...\CreateCandidateSet.c
.........\...\CreateDelaunayCandidateSet.c
.........\...\CreateQuadrantCandidateSet.c
.........\...\Delaunay.c
.........\...\Distance.c
.........\...\Distance_SPECIAL.c
.........\...\eprintf.c
.........\...\Excludable.c
.........\...\Exclude.c
.........\...\FindTour.c
.........\...\Flip.c
.........\...\Flip_SL.c
.........\...\Flip_SSL.c
.........\...\Forbidden.c
.........\...\FreeStructures.c
.........\...\fscanint.c
.........\...\Gain23.c
.........\...\GenerateCandidates.c
.........\...\GeoConversion.c
.........\...\GetTime.c
.........\...\GreedyTour.c
.........\...\Hashing.c
.........\...\Heap.c
.........\...\INCLUDE
.........\...\.......\Delaunay.h
.........\...\.......\GainType.h
.........\...\.......\GeoConversion.h
.........\...\.......\Hashing.h
.........\...\.......\Heap.h
.........\...\.......\LKH.h
.........\...\.......\Segment.h
.........\...\.......\Sequence.h
.........\...\IsCandidate.c
.........\...\IsCommonEdge.c
.........\...\KSwapKick.c
.........\...\LinKernighan.c
.........\...\LKHmain.c
.........\...\Make2OptMove.c
.........\...\Make3OptMove.c
.........\...\Make4OptMove.c
.........\...\Make5OptMove.c
.........\...\Makefile
.........\...\MakeKOptMove.c
.........\...\malloc.c
.........\...\MergeBetterTourWithBestTour.c
.........\...\MergeWithTour.c
.........\...\Minimum1TreeCost.c
.........\...\MinimumSpanningTree.c
.........\...\NormalizeNodeList.c
.........\...\NormalizeSegmentList.c
.........\...\OBJ
.........\...\OrderCandidateSet.c
.........\...\PatchCycles.c
.........\...\printff.c
.........\...\PrintParameters.c
.........\...\qsort.c
.........\...\Random.c
.........\...\ReadCandidates.c
.........\...\ReadLine.c
.........\...\ReadParameters.c
.........\...\ReadPenalties.c
.........\...\ReadProblem.c
.........\...\RecordBestTour.c
.........\...\RecordBetterTour.c
.........\...\RemoveFirstActive.c
.........\...\ResetCandidateSet.c
.........\...\RestoreTour.c
.........\...\SegmentSize.c
    

CodeBus www.codebus.net