| lau15 | R Documentation |
15 abstract cities for which a traveling salesman solution is sought. Solution: A path with a length of 291.
lau15
An object of class list of length 14.
Lau, H. T. (1986): Combinatorial Heuristic Algorithms in FORTRAN. Springer, 1986. <doi:10.1007/978-3-642-61649-5>
Other Problem Environment:
NewEnvXOR(),
Parabola2D,
Parabola2DEarly
names(lau15)
lau15$genelength()
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.