{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:23:05Z","timestamp":1761294185113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_21","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"317-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Minimal Perturbation in University Timetabling with Maximum Satisfiability"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3876-1011","authenticated-orcid":false,"given":"Alexandre","family":"Lemos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7934-5495","authenticated-orcid":false,"given":"Pedro T.","family":"Monteiro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4868-415X","authenticated-orcid":false,"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"21_CR1","unstructured":"McCollum, B.: University timetabling: bridging the gap between research and practice. In: 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pp. 15\u201335(2006)"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-017-2688-8","volume":"275","author":"RA Oude Vrielink","year":"2017","unstructured":"Oude Vrielink, R.A., Jansen, E.A., Hans, E.W., van Hillegersberg, J.: Practices in timetabling in higher education institutions: a systematic review. Ann. Oper. Res. 275(1), 145\u2013160 (2017). https:\/\/doi.org\/10.1007\/s10479-017-2688-8","journal-title":"Ann. Oper. Res."},{"key":"21_CR3","unstructured":"M\u00fcller, T., Rudov\u00e1, H., M\u00fcllerov\u00e1, Z.: University course timetabling and international timetabling competition 2019. In: Proceedings of 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT), p. 27 (2018)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller, T.: ITC-2007 solver description: a hybrid approach. Ann. Oper. Res. 172(1), 429 (2009). https:\/\/doi.org\/10.1007\/s10479-009-0644-y","journal-title":"Ann. Oper. Res."},{"key":"21_CR5","unstructured":"Di Gaspero, L., Schaerf, A., McCollum, B.: The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). Technical report, Queen\u2019s University (2007)"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0305-0548(86)90025-0","volume":"13","author":"G Laporte","year":"1986","unstructured":"Laporte, G., Desroches, S.: The problem of assigning students to course sections in a large engineering school. Comput. Oper. Res. 13(4), 387\u2013394 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. Soc. Ind. Appl. Math. J. Comput. 5(4), 691\u2013703 (1976). https:\/\/doi.org\/10.1137\/0205048","journal-title":"Soc. Ind. Appl. Math. J. Comput."},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11593577_8","volume-title":"Practice and Theory of Automated Timetabling V","author":"T M\u00fcller","year":"2005","unstructured":"M\u00fcller, T., Rudov\u00e1, H., Bart\u00e1k, R.: Minimal perturbation problem in course timetabling. In: Burke, E., Trick, M. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 126\u2013146. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593577_8"},{"key":"21_CR9","unstructured":"Atsuta, M., Nonobe, K., Ibaraki, T.: ITC-2007 track 2: an approach using a general CSP solver. In: 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pp. 19\u201322 (2008)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","volume":"275","author":"M Banbara","year":"2019","unstructured":"Banbara, M., et al.: $$teaspoo{n:}$$ solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1), 3\u201337 (2019). https:\/\/doi.org\/10.1007\/s10479-018-2757-7","journal-title":"Ann. Oper. Res."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-30446-1_7","volume-title":"Software Engineering and Formal Methods","author":"PM Bittner","year":"2019","unstructured":"Bittner, P.M., Th\u00fcm, T., Schaefer, I.: SAT encodings of the At-Most-k constraint- a case study on configuring university courses. In: \u00d6lveczky, P.C., Sala\u00fcn, G. (eds.) SEFM 2019. Lecture Notes in Computer Science, vol. 11724, pp. 127\u2013144. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30446-1_7"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-012-1081-x","volume":"218","author":"R As\u00edn Ach\u00e1","year":"2012","unstructured":"As\u00edn Ach\u00e1, R., Nieuwenhuis, R.: Curriculum-based course timetabling with SAT and MaxSAT. Ann. Oper. Res. 218(1), 71\u201391 (2012). https:\/\/doi.org\/10.1007\/s10479-012-1081-x","journal-title":"Ann. Oper. Res."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"100092","DOI":"10.1016\/j.orp.2018.100092","volume":"6","author":"A Lemos","year":"2019","unstructured":"Lemos, A., Melo, F.S., Monteiro, P.T., Lynce, I.: Room usage optimization in timetabling: a case study at Universidade de Lisboa. Oper. Res. Perspect. 6, 100092 (2019). https:\/\/doi.org\/10.1016\/j.orp.2018.100092","journal-title":"Oper. Res. Perspect."},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2019.01.026","volume":"276","author":"M Lindahl","year":"2019","unstructured":"Lindahl, M., Stidsen, T., S\u00f8rensen, M.: Quality recovering of university timetables. Eur. J. Oper. Res. 276(2), 422\u2013435 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10479-015-2094-z","volume":"252","author":"AE Phillips","year":"2016","unstructured":"Phillips, A.E., Walker, C.G., Ehrgott, M., Ryan, D.M.: Integer programming for minimal perturbation problems in university course timetabling. Ann. Oper. Res. 252(2), 283\u2013304 (2016). https:\/\/doi.org\/10.1007\/s10479-015-2094-z","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ejor.2019.11.024","volume":"283","author":"A G\u00fclc\u00fc","year":"2020","unstructured":"G\u00fclc\u00fc, A., Akkan, C.: Robust university course timetabling problem subject to single and multiple disruptions. Eur. J. Oper. Res. 283(2), 630\u2013646 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s10601-011-9108-5","volume":"16","author":"R Zivan","year":"2011","unstructured":"Zivan, R., Grubshtein, A., Meisels, A.: Hybrid search for minimal perturbation in dynamic CSPs. Constraints 16(3), 228\u2013249 (2011). https:\/\/doi.org\/10.1007\/s10601-011-9108-5","journal-title":"Constraints"},{"key":"21_CR18","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: 20th National Conference on Artificial Intelligence and 17th Innovative Applications of Artificial Intelligence, pp. 372\u2013377 (2005)"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950). https:\/\/doi.org\/10.1002\/j.1538-7305.1950.tb00463.x","journal-title":"Bell Syst. Tech. J."},{"key":"21_CR20","volume-title":"Handbook of Satisfiability","author":"A Biere","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability, vol. 185. IOS Press, Amsterdam (2009)"},{"issue":"1\u20134","key":"21_CR21","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. J. Satisf. Boolean Model. Comput. 2(1\u20134), 1\u201326 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-44629-X_5","volume-title":"Practice and Theory of Automated Timetabling III","author":"MW Carter","year":"2001","unstructured":"Carter, M.W.: A comprehensive course timetabling and student scheduling system at the University of Waterloo. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 64\u201382. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44629-X_5"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-017-2621-1","volume":"275","author":"D Schindl","year":"2017","unstructured":"Schindl, D.: Optimal student sectioning on mandatory courses with various sections numbers. Ann. Oper. Res. 275(1), 209\u2013221 (2017). https:\/\/doi.org\/10.1007\/s10479-017-2621-1","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"21_CR24","first-page":"139","volume":"7","author":"O Roussel","year":"2011","unstructured":"Roussel, O.: Controlling a solver execution with the runsolver tool. J. Satisf. Boolean Model. Comput. 7(4), 139\u2013144 (2011)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Nadel, A.: Anytime weighted MaxSAT with improved polarity selection and bit-vector optimization. In: Proceedings of the 19th Conference on Formal Methods in Computer Aided Design (FMCAD) (2019)","DOI":"10.23919\/FMCAD.2019.8894273"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Nadel, A.: TT-Open-WBO-Inc: tuning polarity and variable selection for anytime SAT-based optimization. In: Proceedings of the MaxSAT Evaluations (2019)","DOI":"10.3233\/SAT-200126"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-98334-9_15","volume-title":"Principles and Practice of Constraint Programming","author":"S Joshi","year":"2018","unstructured":"Joshi, S., Kumar, P., Martins, R., Rao, S.: Approximation strategies for incomplete MaxSAT. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 219\u2013228. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_15"},{"issue":"3\u20134","key":"21_CR28","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10472-011-9233-2","volume":"62","author":"J Marques-Silva","year":"2011","unstructured":"Marques-Silva, J., Argelich, J., Gra\u00e7a, A., Lynce, I.: Boolean lexicographic optimization: algorithms & applications. Ann. Math. Artif. Intell. 62(3\u20134), 317\u2013343 (2011). https:\/\/doi.org\/10.1007\/s10472-011-9233-2","journal-title":"Ann. Math. Artif. Intell."},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F.: Mapping problems with finite-domain variables into problems with Boolean variables. In: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), vol. 3542, pp. 1\u201315 (2004)","DOI":"10.1007\/11527695_1"},{"issue":"2","key":"21_CR30","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"JP Warners","year":"1998","unstructured":"Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett. 68(2), 63\u201369 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"21_CR31","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1287\/inte.28.5.29","volume":"28","author":"DH Fylstra","year":"1998","unstructured":"Fylstra, D.H., Lasdon, L.S., Watson, J., Waren, A.D.: Design and use of the microsoft excel solver. Interfaces 28(5), 29\u201355 (1998). https:\/\/doi.org\/10.1287\/inte.28.5.29","journal-title":"Interfaces"}],"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-58942-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:58:27Z","timestamp":1668819507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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 (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":"72","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":"25","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":"7","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":"35% - 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.08","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":"3.08","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)"}}]}}