{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:03:50Z","timestamp":1765609430124},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,6]],"date-time":"2010-04-06T00:00:00Z","timestamp":1270512000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11590-010-0187-9","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T00:16:20Z","timestamp":1270599380000},"page":"609-617","source":"Crossref","is-referenced-by-count":3,"title":["On the Hamming distance in combinatorial optimization problems on hypergraph matchings"],"prefix":"10.1007","volume":"4","author":[{"given":"Alla","family":"Kammerdiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlo A.","family":"Krokhmal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,6]]},"reference":[{"issue":"5","key":"187_CR1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E.D. Weinberger","year":"1990","unstructured":"Weinberger E.D.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol. Cybern. 63(5), 325\u2013336 (1990)","journal-title":"Biol. Cybern."},{"issue":"1","key":"187_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"P.F. Stadler","year":"1996","unstructured":"Stadler P.F.: Landscapes and their correlation functions. J. Math. Chem. 20(1), 1\u201345 (1996)","journal-title":"J. Math. Chem."},{"key":"187_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3155-2","volume-title":"Nonlinear Assignment Problems: Algorithms and Applications","author":"P.M. Pardalos","year":"2000","unstructured":"Pardalos P.M., Pitsoulis L.: Nonlinear Assignment Problems: Algorithms and Applications. Kluwer, Dordrecht (2000)"},{"issue":"1\u20133","key":"187_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0166-218X(01)00343-2","volume":"123","author":"R.E. Burkard","year":"2002","unstructured":"Burkard R.E.: Selected topics on assignment problems. Discret. Appl. Math. 123(1\u20133), 257\u2013302 (2002)","journal-title":"Discret. Appl. Math."},{"key":"187_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment Problems","author":"R.E. Burkard","year":"2009","unstructured":"Burkard R.E., Dell\u2019Amico M., Martello S.: Assignment Problems. SIAM, Philadelphia (2009)"},{"key":"187_CR6","volume-title":"Hypergraphs Combinatorics of Finite Sets","author":"C. Berge","year":"1989","unstructured":"Berge C.: Hypergraphs Combinatorics of Finite Sets. North-Holland, Amsterdam (1989)"},{"issue":"2","key":"187_CR7","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W. Pierskalla","year":"1968","unstructured":"Pierskalla W.: The multidimensional assignment problem. Oper. Res. 16(2), 422\u2013431 (1968)","journal-title":"Oper. Res."},{"key":"187_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4757-3023-4_2","volume-title":"Handbook of Combinatorial Optimization, Supplement Volume A","author":"R.E. Burkard","year":"1999","unstructured":"Burkard R.E., \u00c7ela E.: Linear assignment problems and extensions. In: Du, D.-Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization, Supplement Volume A, pp. 75\u2013149. Kluwer, Dordrecht (1999)"},{"issue":"2","key":"187_CR9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.ejor.2006.11.014","volume":"184","author":"P.M. Hahn","year":"2008","unstructured":"Hahn P.M., Kim B.J., Stuetzle T., Kanthak S., Hightower W.L., Samra H., Ding Z., Guignard M.: The quadratic three-dimensional assignment problem Exact and approximate solution methods. Eur. J. Oper. Res. 184(2), 416\u2013428 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"187_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"R.W. Hamming","year":"1950","unstructured":"Hamming R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 26(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"issue":"9","key":"187_CR11","doi-asserted-by":"crossref","first-page":"4251","DOI":"10.1109\/TIT.2006.880050","volume":"52","author":"R. Matsumoto","year":"2006","unstructured":"Matsumoto R., Kurosawa K., Itoh T., Konno T., Uyematsu T.: Primal-dual distance bounds of linear codes with application to cryptography. IEEE Trans. Info. Theory 52(9), 4251\u20134256 (2006)","journal-title":"IEEE Trans. Info. Theory"},{"issue":"4","key":"187_CR12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz P., Freisleben B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4), 337\u2013352 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"187_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"R. Stanley","year":"1986","unstructured":"Stanley R.: Enumerative Combinatorics. Wadsworth & Brooks, Belmont (1986)"},{"key":"187_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker R., Volgenant A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38, 325\u2013340 (1987)","journal-title":"Computing"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0187-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0187-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0187-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:04Z","timestamp":1559574904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0187-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,6]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["187"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0187-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,6]]}}}