org.cicirello.search.problems.tsp (Chips-n-Salsa - A Java library of customizable, hybridizable, iterative, parallel, stochastic, and self-adaptive local search algorithms)

Package of classes and interfaces related to representing computational problems, as well as
classes implementing a variety of specific computational problems.

Package of classes and interfaces related to representing and solving scheduling problems, which
includes implementations of constructive heuristics for scheduling problems.

This class serves as an abstract base class for the various classes that implement variations of
the Traveling Salesperson Problem provided by the library.

This class and its nested classes implement the Traveling Salesperson Problem (TSP), and its
variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance
matrix.

This class implements the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric
Traveling Salesperson Problem (ATSP), by generating a random distance matrix, with
floating-point cost edges.

This class implements the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric
Traveling Salesperson Problem (ATSP), by generating a random distance matrix, with integer cost
edges.

This class and its nested classes implement the Traveling Salesperson Problem (TSP), such that
cities are 2D points, and edge costs is the distance between them.

Cost function for the Traveling Salesperson Problem (TSP), where edge costs are floating-point
valued, and where all edge costs between pairs of cities are precomputed.

Cost function for the Traveling Salesperson Problem (TSP), where edge costs are integer valued,
and where all edge costs between pairs of cities are precomputed.