The Design, Analysis and Implementation of Heuristics
回顾了管理科学中启发式方法从1950年代到1970年代的发展历程，包括优化算法的局限性和计算复杂性理论对启发式研究复兴的推动作用，适合对运筹学或算法设计历史感兴趣的读者。
The 1950s were a flourishing period for Management Science that saw many practical successfully attacked through the application of inelegant but effective heuristics. In the 1960s, attention turned to optimization, leading to the development of algorithms that employed more sophisticated mathematical constructs. While these algorithms were a significant research achievement, they failed to provide for reliable solutions to many problems. The 1970s seem to have been a period of soul searching in which computational complexity results were discovered, providing evidence that those who failed to develop effective optimization algorithms should not be discouraged, since the problems were probably intractable anyway. As a consequence, some of the intellectual energy that had been devoted to optimization began to be directed to the study of heuristics, but from an enriched perspective that emphasized theoretical performance analysis, both worth case and probabilistic.