Randomized algorithms in combinatorial optimization: A survey (Q1077329)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized algorithms in combinatorial optimization: A survey |
scientific article |
Statements
Randomized algorithms in combinatorial optimization: A survey (English)
0 references
1986
0 references
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.
0 references
survey
0 references
heuristics
0 references
NP-hard combinatorial optimization
0 references
randomized local searches
0 references
random polynomial algorithms
0 references
computational complexity
0 references
0 references
0 references
