» ASP Competition | |
|
Travelling Salesperson Optimization VersionProblem description This problem modifies its corresponding decision problem by minimizing the sum of weights of edges in
a Hamiltonian cycle.
For a given undirected graph G = (V,E),
the objective function to minimize is as follows: Input formatSee corresponding decision problem Output formatSee corresponding decision problem Author: Lengning Liu, Miroslaw Truszczynski, and Martin Gebser |