Tell your friends about this item:
Combinatorial Heuristic Algorithms with FORTRAN - Lecture Notes in Economics and Mathematical Systems Hang Tong Lau 1986 edition
Combinatorial Heuristic Algorithms with FORTRAN - Lecture Notes in Economics and Mathematical Systems
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. Traveling Salesman Problem 52 Chapter 5. Steiner Tree Problem 81 Chapter 6.
129 pages, biography
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | November 1, 1986 |
| ISBN13 | 9783540171614 |
| Publishers | Springer-Verlag Berlin and Heidelberg Gm |
| Pages | 129 |
| Dimensions | 155 × 235 × 7 mm · 213 g |
| Language | English |