{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:01:28Z","timestamp":1760101288501,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T00:00:00Z","timestamp":1614988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T00:00:00Z","timestamp":1614988800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10898-021-01003-4","type":"journal-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T06:02:46Z","timestamp":1615010566000},"page":"29-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum feasible subsystems of distance geometry constraints"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4517-873X","authenticated-orcid":false,"given":"Maurizio","family":"Bruglieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5439-1743","authenticated-orcid":false,"given":"Roberto","family":"Cordone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3139-6821","authenticated-orcid":false,"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,6]]},"reference":[{"issue":"9","key":"1003_CR1","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1038\/nature03602","volume":"435","author":"D Achlioptas","year":"2005","unstructured":"Achlioptas, D., Naor, A., Peres, Y.: Rigorous location of phase transitions in hard optimization problems. Nature 435(9), 759\u2013764 (2005)","journal-title":"Nature"},{"key":"1003_CR2","first-page":"27","volume-title":"Algebraic and Geometric Methods in Discrete Mathematics. Contemporary Mathematics","author":"A Ahmadi","year":"2017","unstructured":"Ahmadi, A., Hall, G.: Sum of squares basis pursuit with linear and second order cone programming. In: Harrington, H., Omar, M., Wright, M. (eds.) Algebraic and Geometric Methods in Discrete Mathematics. Contemporary Mathematics, vol. 685, pp. 27\u201354. AMS, Providence, RI (2017)"},{"issue":"2","key":"1003_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/18M118935X","volume":"3","author":"A Ahmadi","year":"2019","unstructured":"Ahmadi, A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geometry 3(2), 193\u2013230 (2019)","journal-title":"SIAM J. Appl. Algebra Geometry"},{"key":"1003_CR4","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.cor.2007.04.001","volume":"35","author":"E Amaldi","year":"2008","unstructured":"Amaldi, E., Bruglieri, M., Casale, G.: A two-phase relaxation-based heuristic for the maximum feasible subsystem problem. Comput. Oper. Res. 35, 1465\u20131482 (2008)","journal-title":"Comput. Oper. Res."},{"key":"1003_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-002-0363-5","volume":"95","author":"E Amaldi","year":"2003","unstructured":"Amaldi, E., Pfetsch, M., Trotter, L.: On the maximum feasible subsystem problem, IISS and IIS-hypergraphs. Math. Program. 95, 533\u2013554 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1003_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.2140\/pjm.1975.57.15","volume":"57","author":"G Barker","year":"1975","unstructured":"Barker, G., Carlson, D.: Cones of diagonally dominant matrices. Pac. J. Math. 57(1), 15\u201332 (1975)","journal-title":"Pac. J. Math."},{"key":"1003_CR7","first-page":"33","volume":"79","author":"A Barvinok","year":"1997","unstructured":"Barvinok, A.: Measure concentration in optimization. Math. Program. 79, 33\u201353 (1997)","journal-title":"Math. Program."},{"issue":"2","key":"1003_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/301970.301972","volume":"46","author":"B Berger","year":"1999","unstructured":"Berger, B., Kleinberg, J., Leighton, T.: Reconstructing a three-dimensional model with arbitrary errors. J. ACM 46(2), 212\u2013235 (1999)","journal-title":"J. ACM"},{"key":"1003_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H Berman","year":"2000","unstructured":"Berman, H., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T., Weissig, H., Shindyalov, I.N., Bourne, P.: The protein data bank. Nucleic Acid Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acid Res."},{"key":"1003_CR10","doi-asserted-by":"crossref","unstructured":"Bhatia, R.: Matrix Analysis. New York (1997)","DOI":"10.1007\/978-1-4612-0653-8"},{"key":"1003_CR11","unstructured":"COIN-OR. Introduction to IPOPT: A tutorial for downloading, installing, and using IPOPT (2006)"},{"issue":"2","key":"1003_CR12","doi-asserted-by":"publisher","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":"1003_CR13","doi-asserted-by":"crossref","unstructured":"Dias, G., Liberti, L.: Diagonally dominant programming in distance geometry. In: Cerulli, R., Fujishige, S., Mahjoub, R. (eds.) International Symposium in Combinatorial Optimization. LNCS, vol. 9849, pp. 225\u2013236. Springer, New York (2016)","DOI":"10.1007\/978-3-319-45587-7_20"},{"key":"1003_CR14","first-page":"749","volume":"6","author":"S Gerschgorin","year":"1931","unstructured":"Gerschgorin, S.: \u00dcber die Abgrenzung der Eigenwerte einer Matrix. Izvestia Akademii Nauk USSR 6, 749\u2013754 (1931)","journal-title":"Izvestia Akademii Nauk USSR"},{"key":"1003_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10898-016-0493-6","volume":"69","author":"D Gon\u00e7alves","year":"2017","unstructured":"Gon\u00e7alves, D., Mucherino, A., Lavor, C., Liberti, L.: Recent advances on the interval distance geometry problem. J. Glob. Optim. 69, 525\u2013545 (2017)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1003_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.2517-6161.1991.tb01825.x","volume":"53","author":"C Goodall","year":"1991","unstructured":"Goodall, C.: Procrustes methods in the statistical analysis of shape. J. R. Stat. Soc. B 53(2), 285\u2013339 (1991)","journal-title":"J. R. Stat. Soc. B"},{"key":"1003_CR17","volume-title":"Trees and hills: methodology for maximizing functions of systems of linear relations. Annals of Discrete Mathematics","author":"R Greer","year":"1984","unstructured":"Greer, R.: Trees and hills: methodology for maximizing functions of systems of linear relations. Annals of Discrete Mathematics, vol. 22. Elsevier, Amsterdam (1984)"},{"issue":"6","key":"1003_CR18","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H Hotelling","year":"1933","unstructured":"Hotelling, H.: Analysis of a complex of statistical variables into principal components. J. Educ. Psychol. 24(6), 417\u2013441 (1933)","journal-title":"J. Educ. Psychol."},{"key":"1003_CR19","unstructured":"IBM. ILOG CPLEX 12.9 User\u2019s Manual. IBM (2019)"},{"key":"1003_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/0-387-30927-6_9","volume-title":"Global Optimization: Scientific and Engineering Case Studies","author":"C Lavor","year":"2006","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Computational experience with the molecular distance geometry problem. In: Pint\u00e9r, J. (ed.) Global Optimization: Scientific and Engineering Case Studies, pp. 213\u2013225. Springer, Berlin (2006)"},{"key":"1003_CR21","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s10898-011-9799-6","volume":"56","author":"C Lavor","year":"2013","unstructured":"Lavor, C., Liberti, L., Mucherino, A.: The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances. J. Glob. Optim. 56, 855\u2013871 (2013)","journal-title":"J. Glob. Optim."},{"key":"1003_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1051\/ro\/2018036","volume":"53","author":"L Liberti","year":"2019","unstructured":"Liberti, L.: Undecidability and hardness in mixed-integer nonlinear programming. RAIRO Oper. Res. 53, 81\u2013109 (2019)","journal-title":"RAIRO Oper. Res."},{"key":"1003_CR23","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11750-020-00563-0","volume":"28","author":"L Liberti","year":"2020","unstructured":"Liberti, L.: Distance geometry and data science. TOP 28, 271\u2013339 (2020)","journal-title":"TOP"},{"key":"1003_CR24","doi-asserted-by":"crossref","unstructured":"Liberti, L., Iommazzo, G., Lavor, C., Maculan, N.: A cycle-based formulation of the Distance Geometry Problem. In C.\u00a0Gentile et\u00a0al., (ed.), Proceedings of 18th Cologne-Twente Workshop, volume\u00a04 of AIRO, Springer, New York (2020)","DOI":"10.1007\/978-3-030-63072-0_8"},{"issue":"1","key":"1003_CR25","doi-asserted-by":"publisher","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."},{"issue":"1","key":"1003_CR26","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s10878-014-9715-3","volume":"28","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Marinelli, F.: Mathematical programming: Turing completeness and applications to software analysis. J. Combin. Optim. 28(1), 82\u2013104 (2014)","journal-title":"J. Combin. Optim."},{"key":"1003_CR27","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.orl.2018.06.006","volume":"46","author":"L Liberti","year":"2018","unstructured":"Liberti, L., Vu, K.: Barvinok\u2019s Naive algorithm in distance geometry. Oper. Res. Lett. 46, 476\u2013481 (2018)","journal-title":"Oper. Res. Lett."},{"key":"1003_CR28","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/BF00450635","volume":"64","author":"P Luisi","year":"1977","unstructured":"Luisi, P.: Molecular conformational rigidity: an approach to quantification. Naturwissenschaften 64, 569\u2013574 (1977)","journal-title":"Naturwissenschaften"},{"key":"1003_CR29","doi-asserted-by":"publisher","first-page":"4486","DOI":"10.1021\/acs.jcim.9b00215","volume":"59","author":"T Malliavin","year":"2019","unstructured":"Malliavin, T., Mucherino, A., Lavor, C., Liberti, L.: Systematic exploration of protein conformational space using a distance geometry approach. J. Chem. Inf. Model. 59, 4486\u20134503 (2019)","journal-title":"J. Chem. Inf. Model."},{"key":"1003_CR30","doi-asserted-by":"crossref","unstructured":"Mucherino, A., Gon\u00e7alves, D.S., Liberti, L., Lin, J.-H., Lavor, C., Maculan, N., MD-JEEP: a new release for discretizable distance geometry problems with interval data. Annals of Computer Science and Information Systems, Sofia, Bulgaria 1\u20137, 2020 (2020)","DOI":"10.15439\/2020F35"},{"key":"1003_CR31","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1006\/jmbi.1997.1044","volume":"269","author":"M Nilges","year":"1997","unstructured":"Nilges, M., Macias, M., O\u2019Donoghue, S., Oschkinat, H.: Automated NOESY interpretation with ambiguous distance restraints: the refined NMR solution structure of the Pleckstrin homology domain from $$\\beta $$-spectrin. J. Mol. Biol. 269, 408\u2013422 (1997)","journal-title":"J. Mol. Biol."},{"key":"1003_CR32","unstructured":"Sahinidis, N.V., Tawarmalani, M.: BARON 7.2.5: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2005)"},{"key":"1003_CR33","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":"1003_CR34","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01003-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01003-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01003-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T14:07:07Z","timestamp":1724594827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01003-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,6]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1003"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01003-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,3,6]]},"assertion":[{"value":"16 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}