Hamiltonian tour

Hamiltonian tour

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
Mentioned in ?
References in periodicals archive ?
The target visitation problem (TVP) consists of finding a Hamiltonian tour starting at node 0 visiting all remaining nodes (called targets) exactly once in some order and returning to node 0.
The TVP was introduced in [4] and combines two classical combinatorial optimization problems: the asymmetric traveling salesman problem (ATSP) asking for a shortest Hamiltonian tour and the linear ordering problem (LOP) which is to find an acyclic tournament of maximum weight.