|
Avtomatika i Telemekhanika, 2004, Issue 7, Pages 60–70
(Mi at1605)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Discrete Optimization
Local optimization in the steiner problem on the euclidean plane
D. T. Lotareva, A. V. Suprunb, A. P. Uzdemira a Institute of Systems Analysis, Russian Academy of Sciences
b Moscow Institute of Physics and Technology
Abstract:
By the local optimal Steiner tree is meant a tree with optimally distributed Steiner points for a given adjacency matrix. The adjacency matrix defines the point of local minimum, and all arrangements (coordinates) of the Steiner points that are admissible for it define the minimum neighborhood. Solution is local optimal if the tree length cannot be reduced by rearranging the Steiner points. An algorithm of local optimization based on the concept of coordinatewise descent was considered.
Citation:
D. T. Lotarev, A. V. Suprun, A. P. Uzdemir, “Local optimization in the steiner problem on the euclidean plane”, Avtomat. i Telemekh., 2004, no. 7, 60–70; Autom. Remote Control, 65:7 (2004), 1089–1098
Linking options:
https://www.mathnet.ru/eng/at1605 https://www.mathnet.ru/eng/at/y2004/i7/p60
|
|