Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity /

• Main Authors: Neumann, Frank. (Author), Witt, Carsten. (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Series: Natural Computing Series,
• Subjects: Computer science.; Information theory.; Computer software.; Artificial intelligence.; Mathematical optimization.; Computer Science.; Algorithm Analysis and Problem Complexity.; Optimization.; Theory of Computation.; Artificial Intelligence (incl. Robotics).
• Online Access: https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-16544-3

Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these search heuristics. This is th...

Table of Contents:

• Introduction
• Combinatorial Optimization and Computational Complexity
• Stochastic Search Algorithms
• Analyzing Stochastic Search Algorithms
• Minimum Spanning Trees
• Maximum Matchings
• Makespan Scheduling
• Shortest Paths
• Eulerian Cycles
• Multi-objective Minimum Spanning Trees
• Minimum Spanning Trees Made Easier
• Covering Problems
• Cutting Problems
• App. A.1, Probability Distributions
• App. A.2, Deviation Inequalities
• App. A.3, Other Useful Formulas
• References.