Note: Microcomputer Performance of “FABLE” on Hoffmann's Data Sets
指出霍夫曼声称其Eureka程序比FABLE快约六倍，但Eureka有一个解非最优，而FABLE所有解均最优，以此讨论程序性能的合法性。
Some of the legitimacy of Hoffmann's (1992) Eureka is gained from his statement that “Eureka … would seem to be approximately six times as fast (as Johnson's (1988) FABLE on the literature set). However, Eureka had one problem for which its solution was one station over the optimal, whereas FABLE's solutions were all optimal.”