{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:41Z","timestamp":1725490121271},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417682"},{"type":"electronic","value":"9783540452416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45241-9_19","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:24:00Z","timestamp":1188296640000},"page":"274-287","source":"Crossref","is-referenced-by-count":4,"title":["A Meta-heuristic for Subset Problems"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Flener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brahim","family":"Hnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeynep","family":"Kiziltan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"19_CR1","unstructured":"J.E. Borrett, E.P.K. Tsang, and N.R. Walsh. Adaptive constraint satisfaction: The quickest-first principle. In Proc. of ECAI\u201996, pp. 160\u2013164. JohnWiley & Sons, 1996."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"An open-ended finite domain constraint solver","author":"M. Carlsson","year":"1997","unstructured":"M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In: H. Glaser, P. Hartel, and H. Kuchen (eds), Proc. of PLILP\u201997, pp. 191\u2013206. LNCS 1292. Springer-Verlag, 1997."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01580268","volume":"10","author":"T. Ellman","year":"1998","unstructured":"T. Ellman, J. Keane, A. Banerjee, and G. Armhold. A transformation system for interactive reformulation of design optimization strategies. Research in Engineering Design 10(1):30\u201361, 1998.","journal-title":"Research in Engineering Design"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"P. Flener, H. Zidoum, and B. Hnich. Schema-guided synthesis of constraint logic programs. In Proc. of ASE\u201998, pp. 168\u2013176. IEEE Computer Society Press, 1998.","DOI":"10.1109\/ASE.1998.732620"},{"key":"19_CR5","unstructured":"P. Flener, B. Hnich, and Z. Kiziltan. Towards schema-guided compilation of set constraint programs. In B. Jayaraman and G. Rossi (eds), Proc. of DPS\u201999, pp. 59\u201366. Tech. Rep. 200, Math. Dept., Univ. of Parma, Italy, 1999."},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Compiling high-level type constructors in constraint programming","author":"P. Flener","year":"2001","unstructured":"P. Flener, B. Hnich, and Z. Kiziltan. Compiling high-level type constructors in constraint programming. In: I.V. Ramakrishnan (ed), Proc. of PADL\u201901. LNCS, this volume. Springer-Verlag, 2001."},{"key":"19_CR7","unstructured":"P.A. Geelen. Dual viewpoint heuristics for binary constraint satisfaction problems. In Proc. of ECAI\u201992, pp. 31\u201335. John Wiley & Sons, 1992."},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C. Gervet","year":"1997","unstructured":"C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3):191\u2013244, 1997.","journal-title":"Constraints"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1613\/jair.177","volume":"4","author":"J.M. Gratch","year":"1996","unstructured":"J.M. Gratch and S.A. Chien. Adaptive problem-solving for large scale scheduling problems: A case study. J. of Artificial Intelligence Research 4:365\u2013396, 1996.","journal-title":"J. of Artificial Intelligence Research"},{"key":"19_CR10","unstructured":"B. Hnich and Z. Kiziltan. Generating programs for k-subset problems. In P. Alexander (ed), Proc. of the ASE\u201999 Doctoral Symposium. 1999."},{"key":"19_CR11","unstructured":"B. Hnich, Z. Kiziltan, and P. Flener. A meta-heuristic for subset decision problems. In: K.R. Apt, E. Monfroy, and F. Rossi (eds), Proc. of the 2000 ERCIM\/CompuLog Workshop on Constraint Programming. 2000."},{"key":"19_CR12","unstructured":"Z. Kiziltan, P. Flener, and B. Hnich. A labelling heuristic for subset problems. Submitted for review. Available via \n                  http:\/\/www.dis.uu.se\/~pierref\/astra\/\n                  \n                ."},{"key":"19_CR13","unstructured":"Z. Kiziltan and P. Flener. An adaptive meta-heuristic for subset problems. Submitted for review. Available via \n                  http:\/\/www.dis.uu.se\/~pierref\/astra\/\n                  \n                ."},{"issue":"1\u20132","key":"19_CR14","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1","author":"S. Minton","year":"1996","unstructured":"S. Minton. Automatically configuring constraint satisfaction programs: A case study. Constraints 1(1\u20132):7\u201343, 1996.","journal-title":"Constraints"},{"key":"19_CR15","unstructured":"T. M\u00fcller. Solving set partitioning problems with constraint programming. In Proc. of PAPPACT\u201998, pp. 313\u2013332. The Practical Application Company, 1998."},{"key":"19_CR16","unstructured":"E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993."},{"key":"19_CR17","unstructured":"E.P.K. Tsang, J.E. Borrett, and A.C.M. Kwan. An attempt to map the performance of a range of algorithm and heuristic combinations. In Proc. of AISB\u201995, pp. 203\u2013216. IOS Press, 1995."},{"key":"19_CR18","unstructured":"P. Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999."},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","volume":"70","author":"C.P. Williams","year":"1994","unstructured":"C.P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence 70:73\u2013117, 1994.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45241-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T23:06:28Z","timestamp":1550876788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45241-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417682","9783540452416"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45241-9_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}