Skip to main content

Research Repository

Advanced Search

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

Authors

Ruben Horn

Daan van den Berg

Pieter Adriaans



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



Downloadable Citations