On the traveling salesman problem with a relaxed Monge matrix
From MaRDI portal
Publication:293365
DOI10.1016/S0020-0190(98)00119-7zbMATH Open1339.90275OpenAlexW1996007173MaRDI QIDQ293365FDOQ293365
Authors: Rainer E. Burkard, Vladimir G. Deineko 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001197?np=y
Recommendations
Cites Work
- Title not available (Why is that?)
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Title not available (Why is that?)
- Perspectives of Monge properties in optimization
- On the recognition of permuted Supnick and incomplete Monge matrices
- Universal conditions for algebraic travelling salesman problems to be efficiently solvable
- Title not available (Why is that?)
- A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
- Three easy special cases of the euclidean travelling salesman problem
- Edgeconvex Circuits and the Traveling Salesman Problem
- Extrema in Space-Time
- Extreme Hamiltonian lines
Cited In (7)
- The cone of Monge matrices: Extremal rays and applications
- The travelling salesman problem on permuted Monge matrices
- The Lazy Travelling Salesman Problem in $\mathbb{R}^2$
- Relaxed tours and path ejections for the traveling salesman problem
- One-Sided Monge TSP Is NP-Hard
- OR Utopia
- Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
This page was built for publication: On the traveling salesman problem with a relaxed Monge matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293365)
