Given a graph, test if the graph contains a Hamiltonian cycle or not. Given a set of n nodes and distances for each pair of nodes, find a roundtrip of minimal total length visiting each node exactly once. This problem is an asymmetric traveling salesman problem with additional constraints. Given a set of n nodes and distances for each pair of nodes, find a Hamiltonian path from node 1 to node n of minimal length which takes given precedence constraints into account. We are given n-1 nodes, one depot and distances from the nodes to the depot, as well as between nodes.
All nodes have demands which can be satisfied by the depot.
For delivery to the nodes, trucks with identical capacities are available. The problem is to find tours for the trucks of minimal total length that satisfy the node demands without violating truck capacity constraint. The number of trucks is not specified. Each tour visits a subset of the nodes and starts and terminates at the depot. In some data files a collection of alternate depots is given.