↓ Skip to main content

Evolutionary Computation in Combinatorial Optimization

Overview of attention for book
Cover of 'Evolutionary Computation in Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem
  3. Altmetric Badge
    Chapter 2 The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling
  4. Altmetric Badge
    Chapter 3 Evolving the Structure of the Particle Swarm Optimization Algorithms
  5. Altmetric Badge
    Chapter 4 A Tabu Search Algorithm for Optimization of Gas Distribution Networks
  6. Altmetric Badge
    Chapter 5 Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm
  7. Altmetric Badge
    Chapter 6 Parametrized GRASP Heuristics for Three-Index Assignment
  8. Altmetric Badge
    Chapter 7 A Memetic Algorithm with Bucket Elimination for the Still Life Problem
  9. Altmetric Badge
    Chapter 8 Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA
  10. Altmetric Badge
    Chapter 9 Particle Swarm for the Traveling Salesman Problem
  11. Altmetric Badge
    Chapter 10 Hierarchical Cellular Genetic Algorithm
  12. Altmetric Badge
    Chapter 11 Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
  13. Altmetric Badge
    Chapter 12 Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach
  14. Altmetric Badge
    Chapter 13 A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems
  15. Altmetric Badge
    Chapter 14 New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm
  16. Altmetric Badge
    Chapter 15 Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
  17. Altmetric Badge
    Chapter 16 A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem
  18. Altmetric Badge
    Chapter 17 Evolutionary Computation in Combinatorial Optimization
  19. Altmetric Badge
    Chapter 18 Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines
  20. Altmetric Badge
    Chapter 19 A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem
  21. Altmetric Badge
    Chapter 20 A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
  22. Altmetric Badge
    Chapter 21 Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
  23. Altmetric Badge
    Chapter 22 A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems
  24. Altmetric Badge
    Chapter 23 An Efficient Hybrid Search Algorithm for Various Optimization Problems
  25. Altmetric Badge
    Chapter 24 A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament
Attention for Chapter 19: A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem
Altmetric Badge

Citations

dimensions_citation
17 Dimensions

Readers on

mendeley
12 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem
Chapter number 19
Book title
Evolutionary Computation in Combinatorial Optimization
Published by
Springer, Berlin, Heidelberg, April 2006
DOI 10.1007/11730095_19
Book ISBNs
978-3-54-033178-0, 978-3-54-033179-7
Authors

Daniel A. M. Rocha, Elizabeth F. Gouvêa Goldbarg, Marco César Goldbarg

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 12 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 3 25%
Student > Ph. D. Student 3 25%
Professor 2 17%
Student > Doctoral Student 1 8%
Student > Master 1 8%
Other 1 8%
Unknown 1 8%
Readers by discipline Count As %
Computer Science 6 50%
Business, Management and Accounting 3 25%
Mathematics 1 8%
Neuroscience 1 8%
Unknown 1 8%