A genetic algorithm for circulant Euclidean distance matrices
被引:2
|
作者:
Rivera-Gallego, W
论文数: 0引用数: 0
h-index: 0
机构:
Mississippi State Univ, NSF, Engn Res Ctr Computat Field Simulat, Mississippi State, MS 39762 USAMississippi State Univ, NSF, Engn Res Ctr Computat Field Simulat, Mississippi State, MS 39762 USA
Rivera-Gallego, W
[1
]
机构:
[1] Mississippi State Univ, NSF, Engn Res Ctr Computat Field Simulat, Mississippi State, MS 39762 USA
This paper presents a fast genetic algorithm to determine three-dimensional configurations of points that generate circulant Euclidean Distance Matrices (EDMs). A parallel implementation is possible by using the message passing interface (MPI) standard. In addition, theoretical results about the polyhedral structure of both the cone of circulant symmetric positive semidefinite matrices and the cone of circulant EDMs are introduced. (C) 1998 Elsevier Science Inc. All rights reserved.
机构:
Vilnius Univ, Inst Data Sci & Digital Technol, Akad Str 4, LT-04812 Vilnius, LithuaniaVilnius Univ, Inst Data Sci & Digital Technol, Akad Str 4, LT-04812 Vilnius, Lithuania
Pozniak, Natalija
Sakalauskas, Leonidas
论文数: 0引用数: 0
h-index: 0
机构:
Vilnius Univ, Inst Data Sci & Digital Technol, Akad Str 4, LT-04812 Vilnius, LithuaniaVilnius Univ, Inst Data Sci & Digital Technol, Akad Str 4, LT-04812 Vilnius, Lithuania
Sakalauskas, Leonidas
Saltyte, Laura
论文数: 0引用数: 0
h-index: 0
机构:
Klaipeda Univ, H Manto Str 84, Klaipeda, LithuaniaVilnius Univ, Inst Data Sci & Digital Technol, Akad Str 4, LT-04812 Vilnius, Lithuania