Combinatorial Heuristic Algorithms with FORTRAN

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:
Operations research.
Decision making.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • I. Integer Programming
  • 1. Integer Linear Programming
  • 2. Zero-one Linear Programming
  • 3. Zero-one Knapsack Problem
  • II. Network Design
  • 4. Traveling Salesman Problem
  • 5. Steiner Tree Problem
  • 6. Graph Partitioning
  • 7. K-Median Location
  • 8. K-Center Location
  • List of Subroutines
  • Bibliographic Notes.

Similar Items