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:
Bibliographic Details
Main Author: Lau, Hang Tong (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1986.
Edition:1st ed. 1986.
Series:Lecture Notes in Economics and Mathematical Systems, 280
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.