↓ Skip to main content

Hybrid Metaheuristics

Overview of attention for book
Cover of 'Hybrid Metaheuristics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Evolutionary Local Search for the Super-Peer Selection Problem and the p -Hub Median Problem
  3. Altmetric Badge
    Chapter 2 An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem
  4. Altmetric Badge
    Chapter 3 Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
  5. Altmetric Badge
    Chapter 4 Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP
  6. Altmetric Badge
    Chapter 5 Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
  7. Altmetric Badge
    Chapter 6 Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
  8. Altmetric Badge
    Chapter 7 A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
  9. Altmetric Badge
    Chapter 8 On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
  10. Altmetric Badge
    Chapter 9 Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement
  11. Altmetric Badge
    Chapter 10 Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge
  12. Altmetric Badge
    Chapter 11 Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric
  13. Altmetric Badge
    Chapter 12 A Hybrid VNS for Connected Facility Location
  14. Altmetric Badge
    Chapter 13 A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
  15. Altmetric Badge
    Chapter 14 Hybrid Numerical Optimization for Combinatorial Network Problems
Attention for Chapter 13: A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
Altmetric Badge

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
3 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 Optimum Communication Spanning Tree Problem
Chapter number 13
Book title
Hybrid Metaheuristics
Published by
Springer, Berlin, Heidelberg, October 2007
DOI 10.1007/978-3-540-75514-2_13
Book ISBNs
978-3-54-075513-5, 978-3-54-075514-2
Authors

Thomas Fischer, Peter Merz

Mendeley readers

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

Geographical breakdown

Country Count As %
Germany 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 2 67%
Student > Ph. D. Student 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Engineering 1 33%