The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
LEDA - A Library of Efficient Data Types and Algorithms ● Searching (7) ● Shortest Path (7) ● Topological Sorting (7) ● Convex Hull (6) ● Minimum Spanning Tree (6) ● Nearest Neighbor Search (6) ● Transitive Closure and Reduction (6) ● Triangulation (6) ● Voronoi Diagrams (6) ● Generating Graphs (5) ● Arbitrary Precision Arithmetic (5) ● Network Flow (5) ● Set Data Structures (5) ● Graph Partition (4) ● Matrix Multiplication (4) ● Random Number Generation (4) ● Solving Linear Equations (3) ● Determinants and Permanents (2) About the Book Send us Mail Go to Main Page This page last modified on Feb 23, 1996. file:///E|/WEBSITE/IMPLEMEN/LEDA/IMPLEMEN.HTM (2 of 2) [19/1/2003 1:36:38]
Discrete Optimization Methods Discrete Optimization Methods The Pascal procedures available in this archive are taken with permission from Discrete Optimization Algorithms with Pascal Programs by Maciej M. Syslo, Narsingh Deo, and Janusz S. Kowalik. This text was published in 1983 by Prentice-Hall, Inc., Englewood Cliffs, NJ. To our knowledge these programs are available nowhere else on the Internet. The field of discrete optimization (as viewed by the authors of the text above) consists of the areas of linear and integer programming, cover problems, knapsack problems, graph theory, network-flow problems, and scheduling. Their text covers these areas, using Pascal programs to elucidate methods of attacking discrete optimization problems. Those programs are downloadable from this site (see the previous page). Some notes on the programs themselves The methods used in the programs tend to speak for themselves, however for in-depth coverage of the problems and algorithms it is advised that a copy of the text be obtained. Many of the data types (particularly array data types) used in the Pascal procedures are assumed to be declared elsewhere (these are more "procedures" than complete programs), and are explicitly named only in the text. As a general rule, however, a naming convention is followed which should clear up most ambiguities. An array of integers which has indices ranging from 1 through N, which would be declared ARRAY[1..N] OF INTEGER , will be denoted by the data-type ARRN . Similarly, a two-dimensional array of integers which would be declared in Pascal as ARRAY[1..N, 1..M] OF INTEGER will be denoted by the data-type ARRNM in the procedures given. ● Download files (local site) ● Files with driver programs and datafiles (local site) ● Index of files in this distribution Problem Links ● Set Cover (5) ● Set Packing (5) ● Shortest Path (5) ● Traveling Salesman Problem (5) ● Knapsack Problem (4) file:///E|/WEBSITE/IMPLEMEN/SYSLO/IMPLEMNT.HTM (1 of 2) [19/1/2003 1:36:39]
- Page 1053 and 1054: 1.6.2 Convex Hull Related Problems
- Page 1055 and 1056: Visual Links Index file:///E|/WEBSI
- Page 1057 and 1058: Visual Links Index file:///E|/WEBSI
- Page 1059 and 1060: Visual Links Index file:///E|/WEBSI
- Page 1061 and 1062: Visual Links Index file:///E|/WEBSI
- Page 1063 and 1064: Visual Links Index file:///E|/WEBSI
- Page 1065 and 1066: Visual Links Index file:///E|/WEBSI
- Page 1067 and 1068: Visual Links Index file:///E|/WEBSI
- Page 1069 and 1070: Visual Links Index file:///E|/WEBSI
- Page 1071 and 1072: Visual Links Index file:///E|/WEBSI
- Page 1073 and 1074: Visual Links Index file:///E|/WEBSI
- Page 1075 and 1076: Visual Links Index file:///E|/WEBSI
- Page 1077 and 1078: Visual Links Index file:///E|/WEBSI
- Page 1079 and 1080: Visual Links Index file:///E|/WEBSI
- Page 1081 and 1082: Visual Links Index file:///E|/WEBSI
- Page 1083 and 1084: About the Ratings About the Ratings
- Page 1085 and 1086: 1.2 Numerical Problems 1.2 Numerica
- Page 1087 and 1088: 1.4 Graph Problems -- polynomial-ti
- Page 1089 and 1090: 1.6 Computational Geometry 1.6 Comp
- Page 1091 and 1092: C++ Language Implementations Algori
- Page 1093 and 1094: C Language Implementations ● POSI
- Page 1095 and 1096: FORTRAN Language Implementations Al
- Page 1097 and 1098: Lisp Language Implementations Algor
- Page 1099 and 1100: Algorithm Repository -- Citations C
- Page 1101 and 1102: Practical Algorithm Design -- User
- Page 1103: LEDA - A Library of Efficient Data
- Page 1107 and 1108: Netlib / TOMS -- Collected Algorith
- Page 1109 and 1110: Netlib / TOMS -- Collected Algorith
- Page 1111 and 1112: Xtango and Polka Algorithm Animatio
- Page 1113 and 1114: Combinatorica Combinatorica Combina
- Page 1115 and 1116: file:///E|/WEBSITE/IMPLEMEN/GRAPHBA
- Page 1117 and 1118: 1.4.1 Connected Components 1.4.1 Co
- Page 1119 and 1120: 1.5.9 Graph Isomorphism 1.5.9 Graph
- Page 1121 and 1122: 1.2.3 Matrix Multiplication 1.2.3 M
- Page 1123 and 1124: 1.6.14 Motion Planning 1.6.14 Motio
- Page 1125 and 1126: 1.4.9 Network Flow 1.4.9 Network Fl
- Page 1127 and 1128: 1.1.2 Priority Queues 1.1.2 Priorit
- Page 1129 and 1130: 1.5.10 Steiner Tree 1.5.10 Steiner
- Page 1131 and 1132: 1.4.5 Transitive Closure and Reduct
- Page 1133 and 1134: About the Book -- The Algorithm Des
- Page 1135 and 1136: About the Book -- The Algorithm Des
- Page 1137 and 1138: Genocop -- Optimization via Genetic
- Page 1139 and 1140: 1.2.6 Linear Programming ● Knapsa
- Page 1141 and 1142: 1.2.7 Random Number Generation ●
- Page 1143 and 1144: 1.3.10 Satisfiability ● Constrain
- Page 1145 and 1146: Qhull - higher dimensional convex h
- Page 1147 and 1148: 1.6.5 Nearest Neighbor Search 1.6.5
- Page 1149 and 1150: 1.6.7 Point Location 1.6.7 Point Lo
- Page 1151 and 1152: 1.6.10 Medial-Axis Transformation 1
- Page 1153 and 1154: 1.6.3 Triangulation 1.6.3 Triangula
Discrete Optimization Methods<br />
Discrete Optimization Methods<br />
<strong>The</strong> Pascal procedures available in this archive are taken with permission from Discrete Optimization<br />
<strong>Algorithm</strong>s with Pascal Programs by Maciej M. Syslo, Narsingh Deo, and Janusz S. Kowalik. This text<br />
was published in 1983 by Prentice-Hall, Inc., Englewood Cliffs, NJ. To our knowledge these programs<br />
are available nowhere else on the Internet.<br />
<strong>The</strong> field of discrete optimization (as viewed by the authors of the text above) consists of the areas of<br />
linear and integer programming, cover problems, knapsack problems, graph theory, network-flow<br />
problems, and scheduling. <strong>The</strong>ir text covers these areas, using Pascal programs to elucidate methods of<br />
attacking discrete optimization problems. Those programs are downloadable from this site (see the<br />
previous page).<br />
Some notes on the programs themselves<br />
<strong>The</strong> methods used in the programs tend to speak for themselves, however for in-depth coverage of the<br />
problems and algorithms it is advised that a copy of the text be obtained. Many of the data types<br />
(particularly array data types) used in the Pascal procedures are assumed to be declared elsewhere (these<br />
are more "procedures" than complete programs), and are explicitly named only in the text. As a general<br />
rule, however, a naming convention is followed which should clear up most ambiguities.<br />
An array of integers which has indices ranging from 1 through N, which would be declared<br />
ARRAY[1..N] OF INTEGER , will be denoted by the data-type ARRN . Similarly, a two-dimensional<br />
array of integers which would be declared in Pascal as ARRAY[1..N, 1..M] OF INTEGER will be<br />
denoted by the data-type ARRNM in the procedures given.<br />
● Download files (local site)<br />
● Files with driver programs and datafiles (local site)<br />
● Index of files in this distribution<br />
Problem Links<br />
● Set Cover (5)<br />
● Set Packing (5)<br />
● Shortest Path (5)<br />
● Traveling Salesman Problem (5)<br />
● Knapsack Problem (4)<br />
file:///E|/WEBSITE/IMPLEMEN/SYSLO/IMPLEMNT.HTM (1 of 2) [19/1/2003 1:36:39]
Change language