Putting Continuous Metaheuristics to Work in Binary Search Spaces

Table 3

Classification summary of binary approach.

Discretization	(i) Rounding off
	(ii) Random-key or small value position
	(iii) Metaheuristic discretization
Binarization	(i) Two-step binarization	(i) Transfer function and binarization
		(ii) Great value priority (GVP) and mapping
		(iii) Angle modulation and rule
	(ii) Continuous-binary operator transformation	(i) Modified algebraic operations: set-based approach
		(ii) Promising regions: quantum binary approach
		(iii) Promising regions: binary method based on estimation of distribution