{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:35Z","timestamp":1725544595186},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540331780"},{"type":"electronic","value":"9783540331797"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11730095_13","type":"book-chapter","created":{"date-parts":[[2006,2,27]],"date-time":"2006-02-27T02:39:56Z","timestamp":1141007996000},"page":"147-158","source":"Crossref","is-referenced-by-count":5,"title":["A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems"],"prefix":"10.1007","author":[{"given":"Britta","family":"Kehden","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-36280-0_17","volume-title":"Relational Methods in Computer Science","author":"R. Berghammer","year":"2002","unstructured":"Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of Relational Algebra Using Binary Decision Diagrams. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol.\u00a02561, pp. 241\u2013257. Springer, Heidelberg (2002)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11555964_4","volume-title":"Computer Algebra in Scientific Computing","author":"R. Berghammer","year":"2005","unstructured":"Berghammer, R., Neumann, F.: RELVIEW \u2013 An OBDD-Based Computer Algebra System for Relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol.\u00a03718, pp. 40\u201351. Springer, Heidelberg (2005)"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/TSE.2005.23","volume":"31","author":"D. Beyer","year":"2005","unstructured":"Beyer, D., Noack, A., Lewerentz, C.: Efficient Relational Calculation for Software Analysis. IEEE Transactions on Software Engineering\u00a031(2), 137\u2013149 (2005)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR5","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw Hill, New York (2001)","edition":"2"},{"key":"13_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TSMCC.2004.841903","volume":"35","author":"J. He","year":"2005","unstructured":"He, J., Yao, X., Li, J.: A Comparative Study of Three Evolutionary Algorithms Incorporating Different Amount of Domain Knowledge for Node Covering Problems. IEEE Transactions on Systems, Man and Cybernetics, Part C\u00a035(2), 266\u2013271 (2005)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part C"},{"key":"13_CR8","unstructured":"Kehden, B., Neumann, F., Berghammer, R.: Relational Implementation of Simple Parallel Evolutionary Algorithms. In: Proc. of the 8th International Conference on Relational Methods in Computer Science (RelMiCS 8), pp. 137\u2013146 (2005)"},{"key":"13_CR9","unstructured":"Leoniuk, B.: ROBDD-based implementation of relational algebra with applications (in German). Diss., Univ. Kiel (2001)"},{"key":"13_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to solve it: Modern heuristics","author":"Z. Michalewicz","year":"2004","unstructured":"Michalewicz, Z.: How to solve it: Modern heuristics, 2nd edn. Springer, Berlin (2004)","edition":"2"},{"key":"13_CR11","unstructured":"Milanese, U.: On the implementation of a ROBDD-based tool for the manipulation and visualization of relations (in German). Diss., Univ. Kiel (2003)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"G.R. Raidl","year":"2003","unstructured":"Raidl, G.R., Julstrom, B.A.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. on Evolutionary Computation\u00a07, 225\u2013239 (2003)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"13_CR13","series-title":"EATCS Monographs on Theoret. Comp. Sci.","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-77968-8","volume-title":"Relations and graphs","author":"G. Schmidt","year":"1993","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and graphs. EATCS Monographs on Theoret. Comp. Sci. Springer, Heidelberg (1993)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-49543-6_18","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"C.-P. Schnorr","year":"1998","unstructured":"Schnorr, C.-P., Subramanian, C.R.: Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 218\u2013231. Springer, Heidelberg (1998)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-30217-9_44","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"S.-M. Soak","year":"2004","unstructured":"Soak, S.-M., Corne, D.W., Ahn, B.-H.: A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 430\u2013439. Springer, Heidelberg (2004)"},{"key":"13_CR16","series-title":"SIAM Monographs on Discr. Math. and Appl.","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching programs and binary decision diagrams: Theory and applications","author":"I. Wegener","year":"2000","unstructured":"Wegener, I.: Branching programs and binary decision diagrams: Theory and applications. SIAM Monographs on Discr. Math. and Appl. SIAM, Philadelphia (2000)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11730095_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:51:19Z","timestamp":1619491879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11730095_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540331780","9783540331797"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11730095_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}