{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:04:04Z","timestamp":1786979044360,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540782742","type":"print"},{"value":"9783540782759","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78275-9_34","type":"book-chapter","created":{"date-parts":[[2008,3,17]],"date-time":"2008-03-17T12:04:12Z","timestamp":1205755452000},"page":"384-395","source":"Crossref","is-referenced-by-count":20,"title":["A Memetic Algorithm for Binary Image Reconstruction"],"prefix":"10.1007","author":[{"given":"Vito","family":"Di Ges\u00f9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giosu\u00e8","family":"Lo Bosco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filippo","family":"Millonzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cesare","family":"Valenti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0012-365X(83)90053-5","volume":"44","author":"R.P. Anstee","year":"1983","unstructured":"Anstee, R.P.: The network flows approach for matrices with given row and column sums. Discrete Mathematics\u00a044, 125\u2013138 (1983)","journal-title":"Discrete Mathematics"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/(SICI)1098-1098(1998)9:2\/3<69::AID-IMA2>3.0.CO;2-L","volume":"9","author":"E. Barcucci","year":"1998","unstructured":"Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Medians of polyominoes: a property for the reconstruction. Int. J. Imaging Syst. Technol.\u00a09, 69\u201377 (1998)","journal-title":"Int. J. Imaging Syst. Technol."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.dam.2005.02.021","volume":"151","author":"J.K. Batenburg","year":"2005","unstructured":"Batenburg, J.K.: An evolutionary algorithm for discrete tomography. Discrete Applied Mathematics\u00a0151, 36\u201354 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"34_CR4","volume-title":"G\u00e9om\u00e9trie discr\u00e8te en analyse d\u2019images","author":"J.-M. Chassery","year":"1991","unstructured":"Chassery, J.-M., Montanvert, A.: G\u00e9om\u00e9trie discr\u00e8te en analyse d\u2019images. Trait\u00e9 des Nouvelles Techonologies, Hermes (1991)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(99)00025-3","volume":"69","author":"M. Chrobak","year":"1999","unstructured":"Chrobak, M., D\u00fcrr, C.: Reconstructing hv-convex polyominoes from orthogonal projections. Information Processing Letters\u00a069, 283\u2013291 (1999)","journal-title":"Information Processing Letters"},{"key":"34_CR6","volume-title":"New ideas in optimization","author":"D. Corne","year":"1999","unstructured":"Corne, D., Dorigo, M., Glover, F.: New ideas in optimization. McGraw-Hill, New York (1999)"},{"issue":"5","key":"34_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.jvlc.2003.10.003","volume":"15","author":"V. Ges\u00f9 Di","year":"2004","unstructured":"Di Ges\u00f9, V., Valenti, C.: The stability problem and noise projections in discrete tomography. Journal of Visual Languages and Computing\u00a015(5), 361\u2013371 (2004)","journal-title":"Journal of Visual Languages and Computing"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM\u00a019(2), 248\u2013264 (1972)","journal-title":"Journal of the ACM"},{"issue":"1\u20132","key":"34_CR9","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.tcs.2005.06.035","volume":"347","author":"A. Frosini","year":"2005","unstructured":"Frosini, A., Nivat, M., Vuillon, L.: An introductive analysis of periodical discrete sets from a tomographical point of view. Theoretical Computer Science\u00a0347(1\u20132), 370\u2013392 (2005)","journal-title":"Theoretical Computer Science"},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D. Gale","year":"1957","unstructured":"Gale, D.: A theorem on flows in networks. Pacific J. Math.\u00a07, 1073\u20131082 (1957)","journal-title":"Pacific J. Math."},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0012-365X(98)00347-1","volume":"202","author":"R.J. Gardner","year":"1999","unstructured":"Gardner, R.J., Gritzmann, P., Prangenberg, D.: On the computational complexity of reconstructing lattice sets from their X-rays. Discrete Mathematics\u00a0202, 45\u201371 (1999)","journal-title":"Discrete Mathematics"},{"key":"34_CR12","volume-title":"Discrete Tomography: Foundations, Algorithms, and Applications","year":"1999","unstructured":"Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations, Algorithms, and Applications. Birkh\u00e4user, Basel (1999)"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-1-4612-1568-4_3","volume-title":"Discrete Tomography: Foundations, Algorithms, and Applications","author":"T.Y. Kong","year":"1999","unstructured":"Kong, T.Y., Herman, G.T.: Tomographic equivalence and switching operations. In: Discrete Tomography: Foundations, Algorithms, and Applications, pp. 59\u201384. Birkh\u00e4user, Basel (1999)"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0734-189X(84)90031-8","volume":"27","author":"A. Kuba","year":"1984","unstructured":"Kuba, A.: The reconstruction of two-directional connected binary patterns from their two orthogonal projections. Computer Vision, Graphics, and Image Processing\u00a027, 249\u2013265 (1984)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"34_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-1-4612-1568-4_8","volume-title":"Discrete Tomography: Foundations, Algorithms, and Applications","author":"S. Matej","year":"1999","unstructured":"Matej, S., Vardi, A., Herman, G.T., Vardi, E.: Binary Tomography Using Gibbs Priors. In: Discrete Tomography: Foundations, Algorithms, and Applications, pp. 191\u2013212. Birkh\u00e4user, Basel (1999)"},{"issue":"4","key":"34_CR16","doi-asserted-by":"publisher","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 Transactions on Evolutionary Computation\u00a04(4), 337\u2013352 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/BFb0056918","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"P. Merz","year":"1998","unstructured":"Merz, P., Freisleben, B.: Memetic algorithms and the fitness landscape of the graph bi-partitioning problem. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 765\u2013774. Springer, Heidelberg (1998)"},{"key":"34_CR18","unstructured":"Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report\u00a0826 (1989)"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Ryser, H.J.: Combinatorial mathematics. The carus mathematical monographs, vol. 14, ch. 6, MAA (1963)","DOI":"10.5948\/UPO9781614440147"},{"key":"34_CR20","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H.J. Ryser","year":"1957","unstructured":"Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canadian J. Math.\u00a09, 371\u2013377 (1957)","journal-title":"Canadian J. Math."},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0012-365X(97)00197-0","volume":"187","author":"B. Wang","year":"1998","unstructured":"Wang, B., Zhang, F.: On the precise number of (0,1)-matrices in A(R,S). Discrete Mathematics\u00a0187, 211\u2013220 (1998)","journal-title":"Discrete Mathematics"},{"key":"34_CR22","first-page":"2335","volume-title":"Proc. of Congress on Evolutionary Computation","author":"P. Zou","year":"2004","unstructured":"Zou, P., Zhou, Z., Chen, G., Yao, X.: A novel memetic algorithm with random multi-local-search: A case study of TSP. In: Proc. of Congress on Evolutionary Computation, vol.\u00a02, pp. 2335\u20132340. IEEE Press, Los Alamitos (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78275-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T01:10:05Z","timestamp":1588468205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78275-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540782742","9783540782759"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78275-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}