On the usefulness of accessibility graphs with combinatorial optimization problems
Garrison W. Greenwood · Journal of Interdisciplinary Mathematics · 2005
The search space of a combinatorial optimization problem can be thought of as a metric space or it can be thought of as a digraph. Both representations are investigated in this paper. We argue only one of these representations is useful for solving the optimization problem.