Randomized algorithms in combinatorial optimization: A survey
The goal of this survey is to point out possible advantages concerning the use of steps of stochastic nature into heuristics for NP-hard combinatorial optimization problems. The first part of the paper deals with various aspects of randomized local searches, the second one is concerned with random polynomial algorithms and computational complexity aspects.
scientific article; zbMATH DE number 3956812
scientific article