Local optimization on graphs (Q1122503): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local optimization on graphs |
scientific article |
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
