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

DOI10.1016/S0166-218X(01)00270-0zbMath1041.90073MaRDI QIDQ1602709

David Blokh, Eugene Levner

Publication date: 24 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

banded matrices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem ⋮ On a property of a three-dimensional matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation algorithm for the maximum traveling salesman problem
• Assignment problem for three-index Jacobi matrices
• Gilmore-Gomory type traveling salesman problems
• Maximizing traveling salesman problem for special matrices
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Two Algorithmic Results for the Traveling Salesman Problem
• THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES

This page was built for publication: An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices