On the classification of NP-complete problems in terms of their correlation coefficient

On the Hardness of the Quadratic Assignment Problem with Metaheuristics

Journal of Heuristics

Simulated annealing applied to test generation: landscape characterization and stopping criteria

Empirical Software Engineering

A polynomial time computation of the exact correlation structure of k-satisfiability landscapes

Proceedings of the 11th Annual conference on Genetic and evolutionary computation

Elementary landscape decomposition of the quadratic assignment problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Optimal phase control for equal-gain transmission in MIMO systems with scalar quantization: complexity and algorithms

IEEE Transactions on Information Theory

Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research

A methodology to find the elementary landscape decomposition of combinatorial optimization problems

Evolutionary Computation

Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization

Journal of Heuristics