A comparison of assignment and matching lower bounds for the symmetric travelling salesman problem

dc.contributor.author	Smith, T.H.C.
dc.contributor.author	Meyer, T.W.S.
dc.date.accessioned	2026-03-03T08:46:50Z
dc.date.available	2026-03-03T08:46:50Z
dc.date.issued	1989-11-29
dc.identifier.citation	Smith T.H.C. and Meyer, T.W.S. 1989. A comparison of assignment and matching lower bounds for the symmetric travelling salesman problem. In: Kritzinger, P. (Ed.) 1989. Proceedings of the 5th Southern African Computer Symposium, 1989. Cape Town: SAICS, pp. 293-299.	en_US
dc.identifier.uri	https://ir.unisa.ac.za/handle/10500/32225
dc.description	Theoretical topics	en_US
dc.description.abstract	Improved lower bounds for the Euclidean travelling salesman problem, based on the assignment relaxation, have previously been presented. We present computational experience which indicates that the (continuous) 2-matching relaxation provides a better lower bound. This lower bound is also better than the assignment lower bound in the case of non-Euclidean travelling salesman problems.	en_US
dc.language.iso	en	en_US
dc.publisher	SAICS	en_US
dc.subject	Travelling salesman problem	en_US
dc.subject	Matching	en_US
dc.subject	Lower bounds	en_US
dc.title	A comparison of assignment and matching lower bounds for the symmetric travelling salesman problem	en_US
dc.type	Book chapter	en_US