{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:47Z","timestamp":1740122447600,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T00:00:00Z","timestamp":1509062400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10898-017-0579-9","type":"journal-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T00:30:36Z","timestamp":1509064236000},"page":"27-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The minimum distance superset problem: formulations and algorithms"],"prefix":"10.1007","volume":"72","author":[{"given":"Leonardo","family":"Fontoura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5715-149X","authenticated-orcid":false,"given":"Rafael","family":"Martinelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Poggi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thibaut","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,27]]},"reference":[{"issue":"2\u20133","key":"579_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation\u2013linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43(2\u20133), 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"579_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109(1), 55\u201368 (2007)","journal-title":"Math. Program."},{"key":"579_CR3","volume-title":"Noisy Data Make the Partial Digest Problem NP-Hard","author":"M Cieliebak","year":"2003","unstructured":"Cieliebak, M., Eidenbenz, S., Penna, P.: Noisy Data Make the Partial Digest Problem NP-Hard. Springer, Berlin (2003)"},{"issue":"3","key":"579_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.tcs.2005.08.030","volume":"349","author":"M Cieliebak","year":"2005","unstructured":"Cieliebak, M., Eidenbenz, S., Penna, P.: Partial digest is hard to solve for erroneous input data. Theor. Comput. Sci. 349(3), 361\u2013381 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"579_CR5","unstructured":"Dakic, T.: On the turnpike problem. Ph.D. thesis, Simon Fraser University (2000)"},{"issue":"2","key":"579_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(01)00073-1","volume":"282","author":"A Daurat","year":"2002","unstructured":"Daurat, A., G\u00e9rard, Y., Nivat, M.: The chords\u2019 problem. Theor. Comput. Sci. 282(2), 319\u2013336 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"579_CR7","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.tcs.2005.05.021","volume":"347","author":"A Daurat","year":"2005","unstructured":"Daurat, A., G\u00e9rard, Y., Nivat, M.: Some necessary clarifications about the chords\u2019 problem and the partial digest problem. Theor. Comput. Sci. 347(1\u20132), 432\u2013436 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"579_CR8","volume-title":"Nonparametric Statistical Methods","author":"M Hollander","year":"2013","unstructured":"Hollander, M., Wolfe, D., Chicken, E.: Nonparametric Statistical Methods. Wiley, Hoboken (2013)"},{"key":"579_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-3-642-55566-4_27","volume-title":"Discrete and Computational Geometry: The Goodman\u2013Pollack Festschrift","author":"P Lemke","year":"2003","unstructured":"Lemke, P., Skiena, S.S., Smith, W.D.: Reconstructing sets from interpoint distances. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry: The Goodman\u2013Pollack Festschrift, pp. 597\u2013631. Springer, Berlin (2003)"},{"issue":"1\u20136","key":"579_CR10","first-page":"517","volume":"90","author":"AL Patterson","year":"1935","unstructured":"Patterson, A.L.: A direct method for the determination of the components of interatomic distances in crystals. Crystal. Mater. 90(1\u20136), 517\u2013542 (1935)","journal-title":"Crystal. Mater."},{"issue":"1935","key":"579_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1103\/PhysRev.65.195","volume":"65","author":"AL Patterson","year":"1944","unstructured":"Patterson, A.L.: Ambiguities in the X-ray analysis of crystal structures. Phys. Rev. 65(1935), 195 (1944)","journal-title":"Phys. Rev."},{"key":"579_CR12","volume-title":"A Reformulation\u2013Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation\u2013Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, Berlin (2013)"},{"key":"579_CR13","doi-asserted-by":"crossref","unstructured":"Skiena, S.S., Smith, W.D., Lemke, P.:Reconstructing sets from interpoint distances (extended abstract). In: Proceedings of the Sixth Annual Symposium on Computational Geometry, SCG\u201990, pp. 332\u2013339. ACM, New York, NY, USA (1990)","DOI":"10.1145\/98524.98598"},{"issue":"2","key":"579_CR14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02460643","volume":"56","author":"SS Skiena","year":"1994","unstructured":"Skiena, S.S., Sundaram, G.: A partial digest approach to restriction site mapping. Bull. Math. Biol. 56(2), 275\u2013294 (1994)","journal-title":"Bull. Math. Biol."},{"issue":"3","key":"579_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1089\/cmb.1994.1.235","volume":"1","author":"Z Zhang","year":"1994","unstructured":"Zhang, Z.: An exponential example for a partial digest mapping algorithm. J. Comput. Biol. 1(3), 235\u2013239 (1994)","journal-title":"J. Comput. Biol."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0579-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0579-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0579-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T02:50:53Z","timestamp":1570243853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0579-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,27]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["579"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0579-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,10,27]]}}}