Local Optimization in the Steiner Problem on the Euclidean Plane

Authors:
D. T. Lotarev;A. V. Suprun;A. P. Uzdemir
Affiliations:
Institute for Systems Analysis, Russian Academy of Sciences, Moscow, Russia;Moscow Physical and Technical Institute, Moscow, Russia;Institute for Systems Analysis,Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2004

Citing 2
Cited 2

Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Location of Transport Nets on a Heterogeneous Territory

Automation and Remote Control

Conversion of the Steiner Problem on the Euclidean Plane to the Steiner Problem on Graph

Automation and Remote Control
Parallelization of local search for Euclidean Steiner tree problem

Proceedings of the 44th annual Southeast regional conference

Quantified Score

Hi-index	0.00

Visualization

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.