+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Combinatorial Heuristic Algorithms with FORTRAN : Lecture Notes in Economic and Mathematical Systems - H. Lau

Combinatorial Heuristic Algorithms with FORTRAN

Lecture Notes in Economic and Mathematical Systems

By: H. Lau

Paperback Published: 1st November 1986
ISBN: 9783540171614
Number Of Pages: 129

Share This Book:


or 4 easy payments of $29.04 with Learn more
Ships in 10 to 15 business days

Earn 232 Qantas Points
on this Book

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 researchers, computer programs are either not implemented on computers or very difficult to obtain. The purpose of this book is to provide a source of FORTRAN coded algorithms for a selected number of well-known combinatorial optimization problems. The book is intended to be used as a supplementary text in combinatorial algorithms, network optimization, operations research and management science. In addition, a short description on each algorithm will allow the book to be used as a convenient reference. This work would not have been possible without the excellent facilities of Bell-Northern Research, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS Page Introduction Part I. INTEGER PROGRAMMING Chapter 1. Integer Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Problem 52 Chapter 5. Steiner Tree Problem 81 Chapter 6. Graph Partitioning 98 Chapter 7. K-Median Location 106 Chapter 8. K-Center Location 114 List of Subroutines 123 Bibliographic Notes 124 INTRODUCTION Following the elegant theory of NP-comp1eteness, the idea of developing efficient heuristic algorithms has been gaining its popularity and significance.

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.

ISBN: 9783540171614
ISBN-10: 3540171614
Series: Lecture Notes in Economic and Mathematical Systems
Audience: General
Format: Paperback
Language: English
Number Of Pages: 129
Published: 1st November 1986
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 0.79
Weight (kg): 0.21

Earn 232 Qantas Points
on this Book