Approximation to the solution of the traveling-salesman problem by C-cycles

For the travelling salesman problem (TSP), a concept of optimality-in-average is introduced. Optimal-in-average Hamiltonian cycles are used by some approximation techniques for finding suboptimal TSP cycles. The methods proposed are compared with known heuristic approximation methods for solving TSP.