The multi-stripe travelling salesman problem

In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with $$q\ge 1$$q≥1, the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic assignment problem. We analyze the computational complexity of the q-stripe TSP for various classes of specially structured distance matrices. We derive NP-hardness results as well as polynomially solvable cases. One of our main results generalizes a well-known theorem of Kalmanson from the classical TSP to the q-stripe TSP.

[1]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[2]  Gerhard J. Woeginger,et al.  Four-point conditions for the TSP: The complete complexity classification , 2014, Discret. Optim..

[3]  Arthur Cayley,et al.  The Collected Mathematical Papers: On Monge's “Mémoire sur la théorie des déblais et des remblais” , 2009 .

[4]  Gerhard J. Woeginger,et al.  Well-solvable special cases of the TSP : a survey , 1996 .

[5]  Michael A. Trick,et al.  The Structure of Circular Decomposable Metrics , 1996, ESA.

[6]  Ján Plesník,et al.  The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two , 1979, Inf. Process. Lett..

[7]  René Sitters,et al.  On the Complexity of Master Problems , 2015, MFCS.

[8]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[9]  Mauro Dell'Amico,et al.  8. Quadratic Assignment Problems: Algorithms , 2009 .

[10]  Timothy J. Lowe,et al.  Locating facilities which interact: Some solvable cases , 1992, Ann. Oper. Res..

[11]  Christoph Helmberg,et al.  The symmetric quadratic traveling salesman problem , 2013, Math. Program..

[12]  Eranda Çela,et al.  The quadratic assignment problem : theory and algorithms , 1999 .

[13]  Sergey Polyakovskiy,et al.  The three-dimensional matching problem in Kalmanson matrices , 2013, J. Comb. Optim..

[14]  Rainer E. Burkard,et al.  Perspectives of Monge Properties in Optimization , 1996, Discret. Appl. Math..

[15]  E. Balas,et al.  New classes of efficiently solvable generalized Traveling Salesman Problems , 1999, Ann. Oper. Res..

[16]  Garth Isaak.  Powers of Hamiltonian paths in interval graphs , 1998, J. Graph Theory.

[17]  Gerhard J. Woeginger,et al.  A solvable case of the quadratic assignment problem , 1998, Oper. Res. Lett..

[18]  Endre Szemerédi,et al.  Proof of the Seymour conjecture for large graphs , 1998 .

[19]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[20]  Gerhard J. Woeginger,et al.  The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases , 1996, Math. Program..

[21]  Kenneth Kalmanson.  Edgeconvex Circuits and the Traveling Salesman Problem , 1975, Canadian Journal of Mathematics.

[22]  Garth Isaak,et al.  Hamiltonian powers in threshold and arborescent comparability graphs , 1999, Discret. Math..

[23]  A. Dress,et al.  A canonical decomposition theory for metrics on a finite set , 1992 .

[24]  Hans L. Bodlaender,et al.  Some Classes of Graphs with Bounded Treewidth , 1988, Bull. EATCS.

[25]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[26]  E. Lawler,et al.  Well-solved special cases , 1985 .

[27]  Jfinos Koml s.  Proof of the Seymour Conjecture for Large Graphs , 2005 .

[28]  V. Deineko,et al.  The Quadratic Assignment Problem: Theory and Algorithms , 1998 .

[29]  Gerhard J. Woeginger,et al.  Sometimes Travelling is Easy: The Master Tour Problem , 1998, SIAM J. Discret. Math..

[30]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[31]  Eranda C Ela,et al.  Assignment Problems , 1964, Comput. J..

[32]  Alan A. Bertossi,et al.  The Edge Hamiltonian Path Problem is NP-Complete , 1981, Inf. Process. Lett..

[33]  Gerhard J. Woeginger,et al.  Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey , 1998, SIAM Rev..

[34]  F. Supnick,et al.  Extreme Hamiltonian Lines , 1957 .

[35]  V. Chepoi,et al.  A Note on Circular Decomposable Metrics , 1998 .

[36]  Gerhard J. Woeginger,et al.  The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases , 1996, IPCO.

[37]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[38]  Alexander V. Kononov,et al.  When difference in machine loads leadsto efficient scheduling in open shops , 1999, Ann. Oper. Res..

[39]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[40]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[41]  Gerhard J. Woeginger,et al.  The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices , 1999, J. Comb. Optim..