2000 character limit reached
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem
Published 23 Aug 2017 in cs.DM and cs.CC | (1708.07217v3)
Abstract: We consider the linearization problem associated with the quadratic traveling salesman problem (QTSP). Necessary and sufficient conditions are given for a cost matrix $Q$ of QTSP to be linearizable. It is shown that these conditions can be verified in $O(n5)$ time. Some simpler sufficient conditions for linearization are also given along with related open problems.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
