The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Adaptive Simulated Annealing Adaptive Simulated Annealing Adaptive Simulated Annealing (ASA) is a C language package which provides the framework and mechanisms for optimization of complex systems using simulated annealing. Users may incorporate these routines into existing C programs, or build applications from the sample ASA applications. Most parameters are user-definable -- allowing for highly customizable optimization algorithms. The code is maintained by Lester Ingber . ● Download ASA files (ingber.com) ● Link to Lester Ingber's ASA page ● Download Files (local site) Problem Links ● Constrained and Unconstrained Optimization (6) About the Book Send us Mail Go to Main Page This page last modified on Mar 11, 1996. file:///E|/WEBSITE/IMPLEMEN/ASA/IMPLEMEN.HTM [19/1/2003 1:36:48]
Genocop -- Optimization via Genetic Algorithms Genocop -- Optimization via Genetic Algorithms Genocop, by Zbigniew Michalewicz, is a genetic algorithm-based program for constrained and unconstrained optimization, written in C. The Genocop system aims at finding a global optimum (minimum or maximum: this is one of the input parameters) of a function; additional linear constraints (equations and inequalities) can be specified as well. The current version of Genocop should run without changes on any BSD-UN*X system (preferably on a Sun SPARC machine). This program can also be run on a DOS system. This software is copyright by Zbigniew Michalewicz. Permission is granted to copy and use the software for scientific, noncommercial purposes only. The software is provided "as is", i.e., without any warranties. ● Original FTP site ● Download Files (local site) Problem Links ● Constrained and Unconstrained Optimization (5) About the Book Send us Mail Go to Main Page This page last modified on Aug 9, 1996. file:///E|/WEBSITE/IMPLEMEN/GENOCOP/IMPLEMEN.HTM [19/1/2003 1:36:49]
- 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 and 1104: LEDA - A Library of Efficient Data
- Page 1105 and 1106: Discrete Optimization Methods Discr
- 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: About the Book -- The Algorithm Des
- 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
- Page 1155 and 1156: Nijenhuis and Wilf: Combinatorial A
- Page 1157 and 1158: 1.5.5 Hamiltonian Cycle 1.5.5 Hamil
- Page 1159 and 1160: 1.4.6 Matching 1.4.6 Matching INPUT
- Page 1161 and 1162: A compendium of NP optimization pro
- Page 1163 and 1164: 1.6.9 Bin Packing 1.6.9 Bin Packing
- Page 1165 and 1166: 1.6.12 Simplifying Polygons 1.6.12
- Page 1167 and 1168: 1.6.13 Shape Similarity 1.6.13 Shap
- Page 1169 and 1170: 1.6.11 Polygon Partitioning 1.6.11
- Page 1171 and 1172: 1.4.3 Minimum Spanning Tree 1.4.3 M
- Page 1173 and 1174: 1.6.15 Maintaining Line Arrangement
- Page 1175 and 1176: 1.3.7 Generating Graphs 1.3.7 Gener
- Page 1177 and 1178: 1.2.11 Discrete Fourier Transform 1
- Page 1179 and 1180: 1.5.8 Edge Coloring 1.5.8 Edge Colo
- Page 1181 and 1182: 1.3.3 Median and Selection 1.3.3 Me
- Page 1183 and 1184: 1.3.1 Sorting 1.3.1 Sorting INPUT O
- Page 1185 and 1186: Plugins for use with the CDROM Plug
Genocop -- Optimization via Genetic <strong>Algorithm</strong>s<br />
Genocop -- Optimization via Genetic <strong>Algorithm</strong>s<br />
Genocop, by Zbigniew Michalewicz, is a genetic algorithm-based program for constrained and<br />
unconstrained optimization, written in C. <strong>The</strong> Genocop system aims at finding a global optimum<br />
(minimum or maximum: this is one of the input parameters) of a function; additional linear constraints<br />
(equations and inequalities) can be specified as well.<br />
<strong>The</strong> current version of Genocop should run without changes on any BSD-UN*X system (preferably on a<br />
Sun SPARC machine). This program can also be run on a DOS system.<br />
This software is copyright by Zbigniew Michalewicz. Permission is granted to copy and use the software<br />
for scientific, noncommercial purposes only. <strong>The</strong> software is provided "as is", i.e., without any<br />
warranties.<br />
● Original FTP site<br />
● Download Files (local site)<br />
Problem Links<br />
● Constrained and Unconstrained Optimization (5)<br />
About the Book<br />
Send us Mail<br />
Go to Main Page<br />
This page last modified on Aug 9, 1996.<br />
file:///E|/WEBSITE/IMPLEMEN/GENOCOP/IMPLEMEN.HTM [19/1/2003 1:36:49]
Change language