Author of the publication

Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem.

, , and . IJCCI, page 246-257. SCITEPRESS, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Universally Hard Hamiltonian Cycle Problem Instances., , and . IJCCI, page 105-111. SCITEPRESS, (2022)Frequency Fitness Assignment on JSSP: A Critical Review., , and . EvoApplications@EvoStar, volume 13989 of Lecture Notes in Computer Science, page 351-363. Springer, (2023)Fireworks Algorithm versus Plant Propagation Algorithm., and . IJCCI, page 101-112. ScitePress, (2019)Can HP-protein Folding Be Solved with Genetic Algorithms? Maybe not., , , , , and . IJCCI, page 131-140. SCITEPRESS, (2023)Exactly characterizable parameter settings in a crossoverless evolutionary algorithm., , , , , and . GECCO Companion, page 1640-1649. ACM, (2022)Solving the Traveling Salesperson Problem using Frequency Fitness Assignment., , , , and . SSCI, page 360-367. IEEE, (2022)The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No., and . SN Comput. Sci., 3 (5): 372 (2022)Parameter Sensitivity Patterns in the Plant Propagation Algorithm., and . IJCCI, page 92-99. SCITEPRESS, (2020)Making Hard(Er) Bechmark Test Functions., and . IJCCI, page 29-38. SCITEPRESS, (2022)Backtracking (the) Algorithms on the Hamiltonian Cycle Problem., and . CoRR, (2021)