{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:30:40Z","timestamp":1759847440386,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_17","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"258-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Maximum Weighted Submatrix Coverage Problem: A CP Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6700-3519","authenticated-orcid":false,"given":"Guillaume","family":"Derval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8688-7498","authenticated-orcid":false,"given":"Vincent","family":"Branders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4835-6519","authenticated-orcid":false,"given":"Pierre","family":"Dupont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3153-8941","authenticated-orcid":false,"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-46227-1_20","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"JOR Aoga","year":"2016","unstructured":"Aoga, J.O.R., Guns, T., Schaus, P.: An efficient algorithm for mining frequent sequence with constraint programming. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9852, pp. 315\u2013330. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-46227-1_20"},{"issue":"9","key":"17_CR2","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1145\/358234.381162","volume":"27","author":"J Bentley","year":"1984","unstructured":"Bentley, J.: Programming pearls: algorithm design techniques. Commun. ACM 27(9), 865\u2013873 (1984)","journal-title":"Commun. ACM"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50137-6","volume-title":"Data Mining and Constraint Programming","year":"2016","unstructured":"Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.): Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-50137-6"},{"unstructured":"Branders, V., Schaus, P., Dupont, P.: Mining a sub-matrix of maximal sum. In: Proceedings of the 6th International Workshop on New Frontiers in Mining Complex Patterns in Conjunction with ECML-PKDD 2017 (2017)","key":"17_CR4"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-319-66158-2_30","volume-title":"Principles and Practice of Constraint Programming","author":"M Chabert","year":"2017","unstructured":"Chabert, M., Solnon, C.: Constraint programming for multi-criteria conceptual clustering. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 460\u2013476. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66158-2_30"},{"unstructured":"Dao, T., Docquier, F., Maurel, M., Schaus, P.: Global migration in the 20th and 21st centuries: the unstoppable force of demography (2018)","key":"17_CR6"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.artint.2015.05.006","volume":"244","author":"KC Duong","year":"2017","unstructured":"Duong, K.C., Vrain, C., et al.: Constrained clustering by constraint programming. Artif. Intell. 244, 70\u201394 (2017)","journal-title":"Artif. Intell."},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C Gervet","year":"1997","unstructured":"Gervet, C.: Interval propagation to reason about sets: definition and implementation of a practical language. Constraints 1(3), 191\u2013244 (1997)","journal-title":"Constraints"},{"doi-asserted-by":"publisher","unstructured":"Guillaume, D., Vincent, B., Pierre, D., Pierre, S.: Synthetic dataset used in \"the maximum weighted submatrix coverage problem: A CP approach, November 2018. \n                    https:\/\/doi.org\/10.5281\/zenodo.1688740","key":"17_CR9","DOI":"10.5281\/zenodo.1688740"},{"unstructured":"IOC Research and Reference Service, The Guardian: Olympic sports and medals 1896\u20132014. \n                    https:\/\/www.kaggle.com\/the-guardian\/olympic-games","key":"17_CR10"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). \n                    https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"unstructured":"Kuo, C.T., Ravi, S., Vrain, C., Davidson, I., et al.: Descriptive clustering: ILP and CP formulations with applications. In: IJCAI-ECAI 2018, the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (2018)","key":"17_CR12"},{"unstructured":"Michel, L., Schaus, P., Van Hentenryck, P.: MiniCP: a lightweight solver for constraint programming (2018). \n                    https:\/\/minicp.bitbucket.io","key":"17_CR13"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-662-44851-9_7","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T Van Le","year":"2014","unstructured":"Le Van, T., van Leeuwen, M., Nijssen, S., Fierro, A.C., Marchal, K., De Raedt, L.: Ranked tiling. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8725, pp. 98\u2013113. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-44851-9_7"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB) 1(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB)"},{"unstructured":"OscaR Team: OscaR: Scala in OR (2012). \n                    https:\/\/bitbucket.org\/oscarlib\/oscar","key":"17_CR16"},{"unstructured":"de Saint-Marcq, V.L.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: CP workshop on Techniques for Implementing Constraint Programming Systems (TRICS), pp. 1\u201310 (2013)","key":"17_CR17"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-66158-2_34","volume-title":"Principles and Practice of Constraint Programming","author":"P Schaus","year":"2017","unstructured":"Schaus, P., Aoga, J.O.R., Guns, T.: CoverSize: a global constraint for frequency-based itemset mining. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 529\u2013546. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66158-2_34"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1186\/1471-2105-9-497","volume":"9","author":"MC Souto de","year":"2008","unstructured":"de Souto, M.C., Costa, I.G., de Araujo, D.S., Ludermir, T.B., Schliep, A.: Clustering cancer gene expression data: a comparative study. BMC Bioinform. 9(1), 497 (2008)","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:11:31Z","timestamp":1558984291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}