On the practical importance of asymptotic optimality in certain heuristic algorithms

Psaraftis, H

dc.contributor.author	Psaraftis, H	en
dc.date.accessioned	2014-03-01T01:38:36Z
dc.date.available	2014-03-01T01:38:36Z
dc.date.issued	1984	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/22278
dc.subject	Asymptotic Optimality	en
dc.subject	Heuristic Algorithm	en
dc.subject	Operations Research	en
dc.subject	Relative Error	en
dc.title	On the practical importance of asymptotic optimality in certain heuristic algorithms	en
heal.type	journalArticle	en
heal.identifier.primary	10.1002/net.3230140409	en
heal.identifier.secondary	http://dx.doi.org/10.1002/net.3230140409	en
heal.publicationDate	1984	en
heal.abstract	This article presents an informal discussion of the issue of asymptotic optimality of heuristics from the viewpoint of the operations research practitioner. It is suggested that certain heuristics belonging to the above class are likely to perform questionably in practice, with regard both to relative error and to computational tractability. Possi- ble explanations of this phenomenon are offered and suggestions	en
heal.journalName	Networks	en
dc.identifier.doi	10.1002/net.3230140409	en