Crossmark

Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints

Crossref DOI link: https://doi.org/10.1007/s10589-020-00189-9

Published Online: 2020-04-27

Published Print: 2020-06

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Lu, Si-Tong

Zhang, Miao

Li, Qing-Na http://orcid.org/0000-0003-1749-5807
Funding

Funding for this research was provided by:

National Natural Science Foundation of China (11671036)
License Information

Text and Data Mining valid from 2020-04-27

Version of Record valid from 2020-04-27
More Information

Article History

Received: 9 July 2019

First Online: 27 April 2020