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. Although algorithms have been designed and are notorious among re...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1986, 1986
|
| Edition: | 1st ed. 1986 |
| Series: | Lecture Notes in Economics and Mathematical Systems
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
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