{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:03Z","timestamp":1725518403009},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876991"},{"type":"electronic","value":"9783540877004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_91","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T07:50:04Z","timestamp":1221292204000},"page":"919-928","source":"Crossref","is-referenced-by-count":1,"title":["A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lukasiewycz","sequence":"first","affiliation":[]},{"given":"Michael","family":"Gla\u00df","sequence":"additional","affiliation":[]},{"given":"J\u00fcrgen","family":"Teich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"91_CR1","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"91_CR2","doi-asserted-by":"crossref","unstructured":"Lukasiewycz, M., Gla\u00df, M., Haubelt, C., Teich, J.: SAT-Decoding in Evolutionary Algorithms for Discrete Constrained Optimization Problems. In: Proceedings of CEC 2007, pp. 935\u2013942 (2007)","DOI":"10.1109\/CEC.2007.4424570"},{"issue":"11-12","key":"91_CR3","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"C. Coello","year":"2002","unstructured":"Coello, C.: Theoretical and numerical constraint handling techniques used with evolutionary algorithms: A survey of the state of the art. Art. Computer Methods in Applied Mechanics and Engineering\u00a0191(11-12), 1245\u20131287 (2002)","journal-title":"Art. Computer Methods in Applied Mechanics and Engineering"},{"issue":"1","key":"91_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation\u00a04(1), 1\u201332 (1996)","journal-title":"Evolutionary Computation"},{"issue":"4","key":"91_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation\u00a03(4), 257\u2013271 (1999)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"91_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BFb0056866","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"S. Koziel","year":"1998","unstructured":"Koziel, S., Michalewicz, Z.: A decoder-based evolutionary algorithm for constrained parameter optimization problems. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 231\u2013240. Springer, Heidelberg (1998)"},{"key":"91_CR7","doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-boolean constraint solver. In: Proceedings of DAC 2003, pp. 830\u2013835 (2003)","DOI":"10.1145\/775832.776041"},{"key":"91_CR8","doi-asserted-by":"crossref","unstructured":"Lukasiewycz, M., Gla\u00df, M., Haubelt, C., Teich, J.: Efficient symbolic multi-objective design space exploration. In: Proceedings of the ASP-DAC 2008, pp. 691\u2013696 (2008)","DOI":"10.1109\/ASPDAC.2008.4484040"},{"key":"91_CR9","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: Proceedings of DAC 2002, pp. 731\u2013736 (2002)","DOI":"10.1109\/DAC.2002.1012719"},{"key":"91_CR10","doi-asserted-by":"crossref","unstructured":"Prasad, M.R., Chong, P., Keutzer, K.: Why is ATPG easy? In: Proceedings of DAC 1999, pp. 22\u201328 (1999)","DOI":"10.1145\/309847.309857"},{"key":"91_CR11","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: an update. In: Proceedings of ICCAD 2002, pp. 450\u2013457 (2002)","DOI":"10.1145\/774572.774638"},{"issue":"7","key":"91_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"4","key":"91_CR13","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM\u00a044(4), 585\u2013591 (1997)","journal-title":"J. ACM"},{"key":"91_CR14","unstructured":"Opt4J (Java Optimization Framework), http:\/\/www.opt4j.org\/"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87700-4_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:28:57Z","timestamp":1557779337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}