in recent times researchers have spent a lot attempt in constructing effective heuristic algorithms for fixing the category of NP-complete difficulties that are largely believed to be inherently intractable from the computational viewpoint. even though algorithms were designed and are infamous between researchers, desktop courses are both no longer carried out on desktops or very tough to procure. the aim of this e-book is to supply a resource of FORTRAN coded algorithms for a specific variety of famous combinatorial optimization difficulties. The publication is meant for use as a supplementary textual content in combinatorial algorithms, community optimization, operations study and administration technology. moreover, a quick description on each one set of rules will let the ebook for use as a handy reference. This paintings wouldn't have been attainable with no the superb amenities of Bell-Northern learn, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS web page advent half I. INTEGER PROGRAMMING bankruptcy 1. Integer Linear Programming bankruptcy 2. Zero-one Linear Programming 30 bankruptcy three. Zero-one Knapsack challenge 38 half II. community layout bankruptcy four. touring Salesman challenge fifty two bankruptcy five. Steiner Tree challenge eighty one bankruptcy 6. Graph Partitioning ninety eight bankruptcy 7. K-Median position 106 bankruptcy eight. K-Center position 114 checklist of Subroutines 123 Bibliographic Notes 124 creation Following the stylish concept of NP-comp1eteness, the assumption of constructing effective heuristic algorithms has been gaining its attractiveness and significance.