Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity /

• Κύριοι συγγραφείς: Neumann, Frank (Συγγραφέας), Witt, Carsten (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Natural Computing Series,
• Θέματα: Mathematics.; Computer programming.; Computers.; Algorithms.; Artificial intelligence.; Mathematical optimization.; Optimization.; Programming Techniques.; Artificial Intelligence (incl. Robotics).; Algorithm Analysis and Problem Complexity.; Theory of Computation.

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...

Πίνακας περιεχομένων:

• Basics
• Combinatorial Optimization and Computational Complexity
• Stochastic Search Algorithms
• Analyzing Stochastic Search Algorithms
• Single-objective Optimization
• Minimum Spanning Trees
• Maximum Matchings
• Makespan Scheduling
• Shortest Paths
• Eulerian Cycles
• Multi-objective Optimization
• Multi-objective Minimum Spanning Trees
• Minimum Spanning Trees Made Easier
• Covering Problems
• Cutting Problems.