Combinatorial Heuristic Algorithms with FORTRAN by Hang Tong Lau.
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. Although algorithms have been designed and are notorious among re...
Full description
Saved in: