On the traveling salesman problem with a relaxed Monge matrix

Authors:
Rainer E. Burkard;Vladimir G. Deǐneko
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1998

Citing 0
Cited 2

Four point conditions and exponential neighborhoods for symmetric TSP

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
One-Sided monge TSP is NP-Hard

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.89

Visualization

Abstract