Ruben Horn
The Easiest Hard Problem: Now Even Easier The Easiest Hard Problem, Number Partitioning Problem, Combi- natorial Optimization
Horn, Ruben; Thomson, Sarah L; van den Berg, Daan; Adriaans, Pieter
Citation
Horn, R., Thomson, S. L., van den Berg, D., & Adriaans, P. (2024, July). The Easiest Hard Problem: Now Even Easier The Easiest Hard Problem, Number Partitioning Problem, Combi- natorial Optimization. Presented at ACM Genetic and Evolutionary Computation Conference (GECCO) 2024, Melbourne, Australia
Presentation Conference Type | Conference Abstract |
---|---|
Conference Name | ACM Genetic and Evolutionary Computation Conference (GECCO) 2024 |
Start Date | Jul 14, 2024 |
End Date | Jul 18, 2024 |
Acceptance Date | May 2, 2024 |
Deposit Date | May 3, 2024 |
Peer Reviewed | Not Peer Reviewed |
Book Title | Genetic and Evolutionary Computation Conference (GECCO ’24), July 14–18, 2024, Melbourne, VIC, Australia |
Keywords | The Easiest Hard Problem, Number Partitioning Problem, Combinatorial Optimization |
This file is under embargo due to copyright reasons.
Contact repository@napier.ac.uk to request a copy for personal use.
You might also like
Comparing communities of optima with funnels in combinatorial fitness landscapes
(2017)
Presentation / Conference Contribution
Multifractality and dimensional determinism in local optima networks
(2018)
Presentation / Conference Contribution
On the Fractal Nature of Local Optima Networks
(2018)
Presentation / Conference Contribution
The effect of landscape funnels in QAPLIB instances
(2017)
Presentation / Conference Contribution
Unexplained Fluctuations in Particle Swarm Optimisation Performance with Increasing Problem Dimensionality
(2023)
Presentation / Conference Contribution
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search