Maximizing traveling salesman problem for special matrices

DOI10.1016/0166-218X(94)00074-NzbMath0819.90116OpenAlexW2043589600MaRDI QIDQ1343160

Gregory Gutin, David Blokh

Publication date: 1 February 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00074-n

zbMATH Keywords

approximate solutiontravelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

An approximation algorithm for the maximum traveling salesman problem ⋮ The maximum travelling salesman problem on symmetric Demidenko matrices ⋮ On a property of a three-dimensional matrix ⋮ On the core of multiple longest traveling salesman games ⋮ Algorithms – ESA 2004 ⋮ THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES ⋮ An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assignment problem for three-index Jacobi matrices
• An Analysis of the Greedy Heuristic for Independence Systems
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit

This page was built for publication: Maximizing traveling salesman problem for special matrices