Usage: src/lk [options] [filename]
 -                          TSPLIB input on stdin
 --                         End options
 -l --lower-bound <name> <length>
                            Give lower bound, enable milestones
 -c --candidate <p>         Specify candidate cities
      <p> ::= <bp> | <bp> or <p>
      <bp> ::= nn <k> | nq <k>
        nn <k> is k nearest neighbours
        nq <k> is k nearest neighbours in each quadrant
        (nq 10 gives a typical city 40 neighbours)
 --held-karp                Compute approx Held-Karp TSP lower bound,
                            then exit successfully.
 --held-karp-lambda         Compute approx Held-Karp TSP lower bound,
                            print the best Lagrange multipliers found,
                            then exit successfully.
 --extra-backtrack          TSP: Try more possibilities for t7 and t8
                            when t1..t6 is not a legal 3-change
                            Matching: Backtrack to t6, not t8
 --no-extra-backtrack       Turn off --extra-backtrack
                            This is default; compatible with JBMR
 -h --help                  Give this help, then exit
 -i --iterate [n]           Iterated LK n times (default is 1, n default is 20)
 -m --matching              Find cheap weighted perfect matchings
                            rather than short tours
 -M --mst-only              Print the a minimum spanning tree
                            and then exit successfully
 --maxdepth [d]             Limit probe depth to d generic flips
 --no-round                 Don't round distance computations
 -p --print                 Print the LK-optimal tour or matching
 -P --postscript <file>     Generate PostScript output and write to <file>
 -q --quiet                 Same as --verbose 0
 -r --representation <rep>  Specify tour representation (default is array)
      <rep> ::= array | two-level | tld
                            (tld is two-level debugging mode.)
                            (Option -r has no effect if finding a matching)
 -s --start <kind>          Specify staring tour (matching) algorithm
      <kind> ::= canonical | greedy | greedydet | random [seed]
                            canonical is 1,2,3,...,n;
                            random is random order;
                            greedy is 2/3-1/3 randomized Greedy tour;
                            greedydet is pure (deterministic) Greedy tour;
                            Default is `greedy'.
 --seed [<s>]                 Random number seed
      <s> ::= <integer> | now
      Default is now, which means seconds since midnight Jan 1, 1970
 --sfc                      Reorder cities by Moore's space filling curve
 -S --sort <kind>           Specify sorting procedure (default is qsort)
      <kind> ::= qsort (from system library) | dsort (Bentley&McIlroy qsort)
 -u --upper-bound <name> <length>
                            Give upper bound, required for Held-Karp
 -v --verbose [n]           Set verbose level (default is 5, n default is 100)
 --version                  Print LK version number, then exit successfully