Combinatorial Heuristic Algorithms with FORTRAN

In recent years researchers have spent much effort in developing efficient heuristic algorithms for solving the class of NP-complete problems which are widely believed to be inherently intractable from the computational point of view. Traveling Salesman Problem 52 Chapter 5. Steiner Tree Problem 81 Chapter 6.