The maximum travelling salesman problem on symmetric Demidenko matrices
DOI10.1016/S0166-218X(99)00148-1zbMATH Open0945.90048OpenAlexW2098484303MaRDI QIDQ1962061FDOQ1962061
Authors: Vladimir G. Deineko, Gerhard J. Woeginger
Publication date: 20 March 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00148-1
Recommendations
- A bound for the symmetric travelling salesman problem through matroid formulation
- Maximizing traveling salesman problem for special matrices
- The Travelling Salesman Problem in symmetric circulant matrices with two stripes
- scientific article; zbMATH DE number 1855663
- The travelling salesman problem on permuted Monge matrices
- THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES
- scientific article; zbMATH DE number 1342125
- The symmetric quadratic traveling salesman problem
- Symmetric traveling salesman problems
- scientific article; zbMATH DE number 1187152
computational complexitycombinatorial optimizationpolynomial algorithmtravelling salesman problemDemidenko conditionKalmanson conditionSupnick condition
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Title not available (Why is that?)
- Maximizing traveling salesman problem for special matrices
- Title not available (Why is that?)
- A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
- Edgeconvex Circuits and the Traveling Salesman Problem
- Extreme Hamiltonian lines
- Hamiltonian properties of Toeplitz graphs
- Extreme Hamiltonian Circuits. Resolution of the Convex-Odd Case
- Extreme Hamiltonian Circuits. Resolution of the Convex-Even Case
Cited In (15)
- Title not available (Why is that?)
- Algorithms – ESA 2004
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
- The maximum traveling salesman problem on van der Veen matrices
- An approximation algorithm for the maximum traveling salesman problem
- The travelling salesman problem on permuted Monge matrices
- A new asymmetric pyramidally solvable class of the traveling salesman problem
- Maximizing traveling salesman problem for special matrices
- Title not available (Why is that?)
- A bound for the symmetric travelling salesman problem through matroid formulation
- THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES
- Maximum travelling salesman problem. I
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
- Travelling salesman paths on Demidenko matrices
- Four-point conditions for the TSP: the complete complexity classification
This page was built for publication: The maximum travelling salesman problem on symmetric Demidenko matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962061)