Publication | Closed Access

A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements

EngineeringData ScienceMemory RequirementsLocal Search (Optimization)Similarity SearchComputer EngineeringComputational ComplexitySearch AlgorithmLinear Preprocessing TimeComputer ScienceRange SearchingParallel ComputingCombinatorial OptimizationApproximation TheorySignal ProcessingVariable Neighborhood SearchIterated Local Search