An implementation of the Lin-Kernighan heuristics algorithm for the (symmetric) traveling salesman problem (TSP).

linkernighantsp 0.1.3


Group ID:
de.sciss
Artifact ID:
linkernighantsp_2.13
Version:
0.1.3
Release Date:
Sep 12, 2020
Licenses:
MIT
Files:

libraryDependencies += "de.sciss" %% "linkernighantsp" % "0.1.3"

Mill build tool

ivy"de.sciss::linkernighantsp:0.1.3"

Scala CLI

//> using lib de.sciss::linkernighantsp:0.1.3

Ammonite REPL

import $ivy.`de.sciss::linkernighantsp:0.1.3`

<dependency>
  <groupId>de.sciss</groupId>
  <artifactId>linkernighantsp_2.13</artifactId>
  <version>0.1.3</version>
</dependency>

compile group: 'de.sciss', name: 'linkernighantsp_2.13', version: '0.1.3'