Genetic algorithm for circulant Euclidean distance matrices

被引：0
|
作者：
Rivera-Gallego, Wilson
机构：
来源：
Applied Mathematics and Computation (New York) | 1998年 / 97卷 / 2-3期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：197 / 208
相关论文
共 50 条
  • [21] On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices
    Johnson, CR
    Masson, RD
    Trosset, MW
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 397 (1-3) : 253 - 264
  • [22] Realizing Euclidean distance matrices by sphere intersection
    Alencar, Jorge
    Lavor, Carlile
    Liberti, Leo
    DISCRETE APPLIED MATHEMATICS, 2019, 256 : 5 - 10
  • [23] Rank of Hadamard powers of Euclidean distance matrices
    Boris Horvat
    Gašper Jaklič
    Iztok Kavkler
    Milan Randić
    Journal of Mathematical Chemistry, 2014, 52 : 729 - 740
  • [24] Rank of Hadamard powers of Euclidean distance matrices
    Horvat, Boris
    Jaklic, Gasper
    Kavkler, Iztok
    Randic, Milan
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2014, 52 (02) : 729 - 740
  • [25] 3 THEOREMS WITH APPLICATIONS TO EUCLIDEAN DISTANCE MATRICES
    FAREBROTHER, RW
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1987, 95 : 11 - 16
  • [26] A recursive algorithm for the inversion of matrices with circulant blocks
    Tsitsas, Nikolaos L.
    Alivizatos, Emmanouil G.
    Kalogeropoulos, Grigorios H.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (01) : 877 - 894
  • [27] A remark on the faces of the cone of Euclidean distance matrices
    Alfakih, AY
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 414 (01) : 266 - 270
  • [28] NORM ESTIMATES FOR INVERSES OF EUCLIDEAN DISTANCE MATRICES
    SUN, XP
    JOURNAL OF APPROXIMATION THEORY, 1992, 70 (03) : 339 - 347
  • [29] A group majorization ordering for Euclidean distance matrices
    Kurata, Hiroshi
    Sakuma, Tadashi
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 420 (2-3) : 586 - 595
  • [30] Kriging Model with Fractional Euclidean Distance Matrices
    Pozniak, Natalija
    Sakalauskas, Leonidas
    Saltyte, Laura
    INFORMATICA, 2019, 30 (02) : 367 - 390
12345