IAM 2016 Chairs' Welcome & Organization
Abstract
Recommendations
Variations on memetic algorithms for graph coloring problems
Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem. The most effective methods to solve this problem are proved to be hybrid algorithms such as memetic algorithms or quantum annealing. Those hybrid ...
Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation
Special issue on Uncertainty Analysis and Decision Making; Guest Editors: Yan-Kui Liu, Baoding Liu, Jinwu GaoGenetic Algorithms (GAs) and other Evolutionary Algorithms (EAs), as powerful and broadly applicable stochastic search and optimization techniques have been successfully applied in the area of management science, operations research and industrial ...
Robust hyper-heuristic algorithms for the offline oriented/non-oriented 2D bin packing problems
Graphical abstractDisplay Omitted HighlightsNovel hyper-heuristic algorithms are proposed for oriented/non-oriented 2D bin packing problems.The proposed algorithms introduce new crossover and mutation operators for the selection of the heuristics.The ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- Editor:
- Tobias Friedrich,
- General Chair:
- Frank Neumann,
- Program Chair:
- Andrew M. Sutton
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Abstract
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 43Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in