3 papers
cs.AI2026
Inventory of the 12 007 Low-Dimensional Pseudo-Boolean Landscapes Invariant to Rank, Translation, and Rotation
Arnaud Liefooghe, Sébastien Verel
Many randomized optimization algorithms are rank-invariant, relying solely on the relative ordering of solutions rather than absolute fitness values. We introduce a stronger notion…
math.OC2024
On the Effects of Smoothing Rugged Landscape by Different Toy Problems: A Case Study on UBQP
Wei Wang, Jialong Shi, Jianyong Sun +3
The hardness of the Unconstrained Binary Quadratic Program (UBQP) problem is due its rugged landscape. Various algorithms have been proposed for UBQP, including the Landscape Smoot…
math.OC2024
A New Parallel Cooperative Landscape Smoothing Algorithm and Its Applications on TSP and UBQP
Wei Wang, Jialong Shi, Jianyong Sun +2
Combinatorial optimization problem (COP) is difficult to solve because of the massive number of local optimal solutions in his solution space. Various methods have been put forward…