Local optimization on graphs (Q1122503): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(89)90025-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007873061 / rank | |||
Normal rank | |||
Latest revision as of 10:21, 30 July 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
