Hartmut Schmeck
IEEE Transactions on Evolutionary Computation · 2000–2001
A researcher in the Science corpus: 3 papers; trusts 2 researchers and is trusted by 20 researchers here, as inferred from the citation graph.
Whom Hartmut Schmeck trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Hartmut Schmeck overall
Papers from Hartmut Schmeck's perspective
Ordered by how strongly the researchers Hartmut Schmeck trusts endorse each paper. Same corpus, a different order for every researcher.
- Ant colony system: a cooperative learning approach to the traveling salesman problem
- MAX-MIN Ant System (Future generations computer systems)
- Bi-Criterion Optimization with Multi Colony Ant Algorithms (International Conference on Evolutionary Multi-Criterion Optimization)
- Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art (Evolutionary Computation)
- Genetic Algorithms in Search Optimization and Machine Learning
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
- The Traveling Salesman Problem: A Computational Study
- Ant algorithms and stigmergy (Future generations computer systems)
- A Graph-based Ant System and its convergence (Future generations computer systems)
Their papers
- Guidance in evolutionary multi-objective optimization (2001) — 310 citations
- A Multi-population Approach to Dynamic Optimization Problems (2000) — 405 citations
- Ant colony optimization for resource-constrained project scheduling (2000) — 809 citations