Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

Authors:

ISBN: 978-3-642-16543-6 (Print) 978-3-642-16544-3 (Online)

Table of contents (13 chapters)

  1. Front Matter

    Pages I-XII

  2. Basics

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-7

      Introduction

    3. No Access

      Book Chapter

      Pages 9-19

      Combinatorial Optimization and Computational Complexity

    4. No Access

      Book Chapter

      Pages 21-32

      Stochastic Search Algorithms

    5. No Access

      Book Chapter

      Pages 33-48

      Analyzing Stochastic Search Algorithms

  3. Single-objective Optimization

    1. Front Matter

      Pages 49-49

    2. No Access

      Book Chapter

      Pages 51-74

      Minimum Spanning Trees

    3. No Access

      Book Chapter

      Pages 75-94

      Maximum Matchings

    4. No Access

      Book Chapter

      Pages 95-110

      Makespan Scheduling

    5. No Access

      Book Chapter

      Pages 111-131

      Shortest Paths

    6. No Access

      Book Chapter

      Pages 133-146

      Eulerian Cycles

  4. Multi-objective Optimization

    1. Front Matter

      Pages 147-147

    2. No Access

      Book Chapter

      Pages 149-159

      Multi-objective Minimum Spanning Trees

    3. No Access

      Book Chapter

      Pages 161-169

      Minimum Spanning Trees Made Easier

    4. No Access

      Book Chapter

      Pages 171-189

      Covering Problems

    5. No Access

      Book Chapter

      Pages 191-203

      Cutting Problems

  5. Back Matter

    Pages 205-216