Local optimization on graphs (Q1122503)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4106632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local optimization on graphs |
scientific article; zbMATH DE number 4106632 |
Statements
Local optimization on graphs (English)
0 references
1989
0 references
This paper is devoted to the study of the complexity of finding a local optimum of an arbitrary function over a neighborhood graph. Some kind of two-person game is introduced to yield an estimation of the amount of work needed to find a local optimum.
0 references
heuristic
0 references
polynomial time local search
0 references
local optimum
0 references
neighborhood graph
0 references
0.7793654203414917
0 references
0.7786075472831726
0 references
0.7738438248634338
0 references
