{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:57:15Z","timestamp":1760709435333,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684444"},{"type":"electronic","value":"9783319684451"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68445-1_95","type":"book-chapter","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:40:36Z","timestamp":1508805636000},"page":"830-837","source":"Crossref","is-referenced-by-count":7,"title":["Distance Geometry in Linearizable Norms"],"prefix":"10.1007","author":[{"given":"Claudia","family":"D\u2019Ambrosio","sequence":"first","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,24]]},"reference":[{"key":"95_CR1","volume-title":"Distance Geometry: Theory, Methods, and Applications","author":"N Beeker","year":"2013","unstructured":"Beeker, N., Gaubert, S., Glusa, C., Liberti, L.: Is the distance geometry problem in NP? In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)"},{"issue":"12","key":"95_CR2","doi-asserted-by":"crossref","first-page":"4918","DOI":"10.1109\/TSP.2009.2026601","volume":"57","author":"W-Y Chiu","year":"2009","unstructured":"Chiu, W.-Y., Chen, B.-S.: Mobile positioning problem in Manhattan-like urban areas: Uniqueness of solution, optimal deployment of BSs, and fuzzy implementation. IEEE Trans. Sig. Process. 57(12), 4918\u20134929 (2009)","journal-title":"IEEE Trans. Sig. Process."},{"unstructured":"COIN-OR. Introduction to IPOPT: A tutorial for downloading, installing, and using IPOPT (2006)","key":"95_CR3"},{"key":"95_CR4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.dam.2014.08.019","volume":"197","author":"GM Crippen","year":"2015","unstructured":"Crippen, G.M.: An alternative approach to distance geometry using $$\\text{ L } \\infty $$ distances. Discrete Appl. Math. 197, 20\u201326 (2015). Distance Geometry and Applications","journal-title":"Discrete Appl. Math."},{"key":"95_CR5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.orl.2016.11.004","volume":"45","author":"C D\u2019Ambrosio","year":"2017","unstructured":"D\u2019Ambrosio, C., Nannicini, G., Sartor, G.: MILP models for the selection of a small set of well-distributed points. Oper. Res. Lett. 45, 46\u201352 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"95_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00454-016-9846-7","volume":"57","author":"C D\u2019Ambrosio","year":"2017","unstructured":"D\u2019Ambrosio, C., Vu, K., Lavor, C., Liberti, L., Maculan, N.: New error measures and methods for realizing protein graphs from distance data. Discrete Comput. Geom. 57(2), 371\u2013418 (2017)","journal-title":"Discrete Comput. Geom."},{"key":"95_CR7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MSP.2015.2398954","volume":"1053\u20135888","author":"I Dokmani\u0107","year":"2015","unstructured":"Dokmani\u0107, I., Parhizkar, R., Ranieri, J., Vetterli, M.: Euclidean distance matrices: essential theory, algorithms and applications. IEEE Sig. Process. Mag. 1053\u20135888, 12\u201330 (2015)","journal-title":"IEEE Sig. Process. Mag."},{"key":"95_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs i. Publ. Math. (Debrecen) 6, 290\u2013297 (1959)","journal-title":"Publ. Math. (Debrecen)"},{"key":"95_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23\u201337 (2005)","journal-title":"Math. Program."},{"key":"95_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"M Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.: Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. Palermo 22, 1\u201374 (1906)","journal-title":"Rend. Circ. Mat. Palermo"},{"unstructured":"Gill, P.E.: User\u2019s guide for SNOPT version 7.2. Systems Optimization Laboratory. Stanford University, California (2006)","key":"95_CR11"},{"key":"95_CR12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighbourhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"IBM: ILOG CPLEX 12.6 User\u2019s Manual. IBM (2014)","key":"95_CR13"},{"issue":"1","key":"95_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/120875909","volume":"56","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56(1), 3\u201369 (2014)","journal-title":"SIAM Rev."},{"key":"95_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02761110","volume":"93","author":"J Matousek","year":"1996","unstructured":"Matousek, J.: On the distortion required for embedding finite metric spaces into normed spaces. Isr. J. Math. 93, 333\u2013344 (1996)","journal-title":"Isr. J. Math."},{"unstructured":"Matou\u0161ek, J.: Lecture notes on metric embeddings. Technical report, ETH Z\u00fcrich (2013)","key":"95_CR16"},{"key":"95_CR17","volume-title":"Algorithms and Data Structures","author":"K Mehlhorn","year":"2008","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures. Springer, Berlin (2008)"},{"unstructured":"Saxe, J.: Embeddability of weighted graphs in $$k$$ -space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480\u2013489 (1979)","key":"95_CR18"},{"issue":"3","key":"95_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1111\/itor.12292","volume":"24","author":"K Vu","year":"2017","unstructured":"Vu, K., D\u2019Ambrosio, C., Hamadi, Y., Liberti, L.: Surrogate-based methods for black-box optimization. Int. Trans. Oper. Res. 24(3), 393\u2013424 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"95_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1126\/science.2911719","volume":"243","author":"K W\u00fcthrich","year":"1989","unstructured":"W\u00fcthrich, K.: Protein structure determination in solution by nuclear magnetic resonance spectroscopy. Science 243, 45\u201350 (1989)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68445-1_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T13:06:30Z","timestamp":1693141590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68445-1_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684444","9783319684451"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68445-1_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}