Finding a cheap matching

dc.contributor.author	Smith, T.H.C.
dc.date.accessioned	2018-06-06T15:10:00Z
dc.date.available	2018-06-06T15:10:00Z
dc.date.issued	1988
dc.identifier.citation	THC Smith (1988) Finding a cheap matching. Quaestiones Informaticae Vol 6 No 3 1988	en
dc.identifier.issn	0254-2757
dc.identifier.uri	http://hdl.handle.net/10500/24305
dc.description.abstract	We propose an edge exchange algorithm/or finding a cheaper 1-matchingfrom a given ]-matching as well as a heuristic algorithm/or constructing a relatively cheap ]-matching from the optimal solution of a relaxation of the ]-matching problem. Computational experience with these two algorithms as well as two greedy algorithms from the literature is reported.	en
dc.language.iso	en	en
dc.publisher	Computer Society of South Africa (on behalf of SAICSIT)	en
dc.subject	matchings	en
dc.subject	heuristics	en
dc.subject	approximate algorithms	en
dc.subject	empirical analysis	en
dc.title	Finding a cheap matching	en
dc.description.department	School of Computing	en
dcterms.type	Article