THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES

DOI10.1142/S0129054101000886zbMath1320.90068OpenAlexW2089999965MaRDI QIDQ5249292

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

difference equationspolynomial algorithmbanded matricesmaximum traveling salesman problem

Mathematics Subject Classification ID

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

Related Items (1)

An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices

Cites Work

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

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