{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:03:16Z","timestamp":1743058996425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030300470"},{"type":"electronic","value":"9783030300487"}],"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-30048-7_38","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T19:03:06Z","timestamp":1569178986000},"page":"656-673","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generic Constraint-Based Block Modeling Using Constraint Programming"],"prefix":"10.1007","author":[{"given":"Alex","family":"Mattenet","sequence":"first","affiliation":[]},{"given":"Ian","family":"Davidson","sequence":"additional","affiliation":[]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"38_CR1","unstructured":"The world bank: Migration and remittances data. \n                      http:\/\/www.worldbank.org\/en\/topic\/migrationremittancesdiasporaissues\/brief\/migration-remittances-dat"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Bai, Z., Qian, B., Davidson, I.: Discovering models from structural and behavioral brain imaging data. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1128\u20131137. ACM (2018)","DOI":"10.1145\/3219819.3220080"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Bai, Z., Walker, P., Tschiffely, A., Wang, F., Davidson, I.: Unsupervised network discovery for brain imaging data. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 55\u201364. ACM (2017)","DOI":"10.1145\/3097983.3098023"},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0378-8733(96)00297-3","volume":"19","author":"V Batagelj","year":"1997","unstructured":"Batagelj, V.: Notes on blockmodeling. Soc. Netw. 19(2), 143\u2013155 (1997). \n                      https:\/\/doi.org\/10.1016\/S0378-8733(96)00297-3","journal-title":"Soc. Netw."},{"issue":"2","key":"38_CR5","first-page":"455","volume":"1","author":"V Batagelj","year":"2004","unstructured":"Batagelj, V., Mrvar, A., Ferligoj, A., Doreian, P.: Generalized blockmodeling with pajek. Metodoloski zvezki 1(2), 455 (2004)","journal-title":"Metodoloski zvezki"},{"key":"38_CR6","unstructured":"Bessiere, C., Hebrard, E., Katsirelos, G., Walsh, T.: Reasoning about connectivity constraints. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-45193-8_54","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C Bessi\u00e8re","year":"2003","unstructured":"Bessi\u00e8re, C., Van Hentenryck, P.: To be or not to be... a global constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 789\u2013794. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-45193-8_54"},{"issue":"6","key":"38_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.jmp.2009.08.003","volume":"53","author":"MJ Brusco","year":"2009","unstructured":"Brusco, M.J., Steinley, D.: Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence. J. Math. Psychol. 53(6), 577\u2013585 (2009). \n                      https:\/\/doi.org\/10.1016\/j.jmp.2009.08.003","journal-title":"J. Math. Psychol."},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.socnet.2016.05.005","volume":"47","author":"M Dabkowski","year":"2016","unstructured":"Dabkowski, M., Fan, N., Breiger, R.: Exploratory blockmodeling for one-mode, unsigned, deterministic networks using integer programming and structural equivalence. Soc. Netw. 47, 93\u2013106 (2016). \n                      https:\/\/doi.org\/10.1016\/j.socnet.2016.05.005","journal-title":"Soc. Netw."},{"key":"38_CR10","unstructured":"Dooms, G.: The CP(Graph) computation domain in constraint programming. Ph.D. thesis, UCL - Universit\u00e9 Catholique de Louvain (2006). \n                      https:\/\/dial.uclouvain.be\/pr\/boreal\/object\/boreal:107275"},{"key":"38_CR11","first-page":"279","volume":"1","author":"P Doreian","year":"1989","unstructured":"Doreian, P., Albert, L.H.: Partitioning political actor networks: some quantitative tools for analyzing qualitative networks. J. Quant. Anthropol. 1, 279\u2013291 (1989). \n                      https:\/\/www.ifip.com\/PartitioningPoliticalActor.html","journal-title":"J. Quant. Anthropol."},{"key":"38_CR12","volume-title":"Generalized Blockmodeling","author":"P Doreian","year":"2005","unstructured":"Doreian, P., Batagelj, V., Ferligoj, A.: Generalized Blockmodeling. Cambridge University Press, Cambridge (2005)"},{"key":"38_CR13","unstructured":"Drabek, T., Tamminga, H., Kilijanek, T., Adams, C.: Managing multi-organizational emergency responses. University of Colorado, Institute of Behavioral Science, BoulDder (1981)"},{"key":"38_CR14","doi-asserted-by":"publisher","DOI":"10.7208\/chicago\/9780226223544.001.0001","volume-title":"With the Boys: Little League Baseball and Preadolescent Culture","author":"GA Fine","year":"1987","unstructured":"Fine, G.A.: With the Boys: Little League Baseball and Preadolescent Culture. University of Chicago Press, Chicago (1987). google-Books-ID: 2qWgZPuNjEYC"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/1.9781611975321.3","volume-title":"Proceedings of the 2018 SIAM International Conference on Data Mining","author":"Mohadeseh Ganji","year":"2018","unstructured":"Ganji, M., et al.: Image Constrained blockmodelling: a constraint programming approach. In: Proceedings of the 2018 SIAM International Conference on Data Mining, pp. 19\u201327. Proceedings, Society for Industrial and Applied Mathematics, May 2018. DOI: \n                      https:\/\/doi.org\/10.1137\/1.9781611975321.3"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-030-10928-8_10","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Ganji","year":"2019","unstructured":"Ganji, M., et al.: Semi-supervised blockmodelling with pairwise guidance. In: Berlingerio, M., Bonchi, F., G\u00e4rtner, T., Hurley, N., Ifrim, G. (eds.) ECML PKDD 2018. LNCS (LNAI), vol. 11052, pp. 158\u2013174. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-10928-8_10"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-23219-5_10","volume-title":"Principles and Practice of Constraint Programming","author":"S Gay","year":"2015","unstructured":"Gay, S., Hartert, R., Lecoutre, C., Schaus, P.: Conflict ordering search for scheduling problems. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 140\u2013148. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23219-5_10"},{"key":"38_CR18","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2018). \n                      http:\/\/www.gurobi.com"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-59776-8_13","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"Emmanuel Hebrard","year":"2017","unstructured":"Hebrard, E., Siala, M.: Explanation-based weighted degree. In: Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Padua, Italy, 5\u20138 June 2017, Proceedings, pp. 167\u2013175 (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-59776-8_13"},{"key":"38_CR20","first-page":"169","volume-title":"Foundations of Artificial Intelligence","author":"WJ Hoeve van","year":"2006","unstructured":"van Hoeve, W.J., Katriel, I.: Global constraints. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Foundations of Artificial Intelligence, vol. 2, pp. 169\u2013208. Elsevier, Amsterdam (2006)"},{"key":"38_CR21","unstructured":"Krompa\u00df, D., Nickel, M., Jiang, X., Tresp, V.: Non-negative tensor factorization with RESCAL. In: Tensor Methods for Machine Learning, ECML Workshop (2013)"},{"issue":"1","key":"38_CR22","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F Lorrain","year":"1971","unstructured":"Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. J. Math. Sociol. 1(1), 49\u201380 (1971). \n                      https:\/\/doi.org\/10.1080\/0022250X.1971.9989788","journal-title":"J. Math. Sociol."},{"key":"38_CR23","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"Laurent Michel","year":"2012","unstructured":"Michel, L., Hentenryck, P.V.: Activity-based search for black-box constraint programming solvers. In: Proceedings of the 9th International Conference, CPAIOR 2012, Nantes, France, May 28\u2013June 1 2012, pp. 228\u2013243 (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-29828-8_15"},{"key":"38_CR24","unstructured":"OscaR Team: OscaR: Scala in OR (2012). \n                      https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"38_CR25","unstructured":"Prosser, P., Unsworth, C.: A connectivity constraint using bridges. In: ECAI, pp. 707\u2013708 (2006)"},{"key":"38_CR26","unstructured":"le Cl\u00e9ment de Saint-Marcq, V., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: The 19th International Conference on Principles and Practice of Constraint Programming, Uppsala, Sweden, 16\u201320 September 2013 (2013). \n                      https:\/\/dial.uclouvain.be\/pr\/boreal\/object\/boreal:135574"},{"key":"38_CR27","unstructured":"Schulte, C.: Comparing trailing and copying for constraint programming. In: Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29\u2013December 4, 1999, pp. 275\u2013289 (1999)"},{"key":"38_CR28","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"},{"key":"38_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-68155-7_41","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Hentenryck Van","year":"2008","unstructured":"Van Hentenryck, P., Michel, L.: The steel mill slab design problem revisited. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 377\u2013381. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-68155-7_41"},{"issue":"3","key":"38_CR30","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10618-010-0181-y","volume":"22","author":"F Wang","year":"2011","unstructured":"Wang, F., Li, T., Wang, X., Zhu, S., Ding, C.: Community discovery using nonnegative matrix factorization. Data Min. Knowl. Disc. 22(3), 493\u2013521 (2011). \n                      https:\/\/doi.org\/10.1007\/s10618-010-0181-y","journal-title":"Data Min. Knowl. Disc."},{"key":"38_CR31","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"2018","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, 4th edn. Cambridge University Press, Cambridge (2018). No. 8 in Structural analysis in the social sciences","edition":"4"},{"key":"38_CR32","first-page":"203","volume-title":"Trends in Constraint Programming","author":"S Zampelli","year":"2006","unstructured":"Zampelli, S., Deville, Y., Dupont, P.: Symmetry breaking in subgraph pattern matching. In: Benhamou, F., Jussien, N., O\u2019Sullivan, B. (eds.) Trends in Constraint Programming, pp. 203\u2013218. Wiley, Hoboken (2006). (ISBN: 978-1-905209-97-2), \n                      https:\/\/dial.uclouvain.be\/pr\/boreal\/object\/boreal:85004"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30048-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T16:07:55Z","timestamp":1569427675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30048-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030300470","9783030300487"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30048-7_38","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":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stamford, CT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2019.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - 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 (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}