Premium
On the practical importance of asymptotic optimality in certain heuristic algorithms
Author(s) -
Psaraftis Harilaos N.
Publication year - 1984
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230140409
Subject(s) - heuristics , heuristic , class (philosophy) , computer science , phenomenon , mathematical optimization , algorithm , mathematics , artificial intelligence , epistemology , philosophy
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. Possible explanations of this phenomenon are offered and suggestions for further research toward a better understanding of this problem are presented.