THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES

DOI10.1142/S0129054101000886MaRDI QIDQ5249292zbMATH OpenOpenAlexFDO

Authors David Blokh, Eugene Levner

Publication date 30 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054101000886

zbMATH Keywords

banded matricesdifference equationsmaximum traveling salesman problempolynomial algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4191425
• Maximizing traveling salesman problem for special matrices
• scientific article; zbMATH DE number 1855663
• The maximum travelling salesman problem on symmetric Demidenko matrices
• scientific article; zbMATH DE number 1187152
• An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
• scientific article; zbMATH DE number 4218178
• The travelling salesman problem on permuted Monge matrices
• Classes of matrices for the traveling salesman problem
• A certain generalization of the maximum traveling salesman problem

Cites work

• An approximation algorithm for the maximum traveling salesman problem
• Maximizing traveling salesman problem for special matrices
• Two Algorithmic Results for the Traveling Salesman Problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

Cited in

(5)

• Maximizing traveling salesman problem for special matrices
• An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
• The maximum travelling salesman problem on symmetric Demidenko matrices
• scientific article; zbMATH DE number 4191425 (Why is no real title available?)
• scientific article; zbMATH DE number 500420 (Why is no real title available?)

This page was built for publication: THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249292)