{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:23:36Z","timestamp":1743096216016,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_5","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"65-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["MaxSAT-Based Scheduling of B2B Meetings"],"prefix":"10.1007","author":[{"given":"Miquel","family":"Bofill","sequence":"first","affiliation":[]},{"given":"Marc","family":"Garcia","sequence":"additional","affiliation":[]},{"given":"Josep","family":"Suy","sequence":"additional","affiliation":[]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-40627-0_9","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2013","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: A parametric approach for smaller and better encodings of cardinality constraints. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 80\u201396. Springer, Heidelberg (2013)"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-012-1081-x","volume":"218","author":"RJA Ach\u00e1","year":"2014","unstructured":"Ach\u00e1, R.J.A., Nieuwenhuis, R.: Curriculum-based course timetabling with SAT and MaxSAT. Annals OR 218(1), 71\u201391 (2014)","journal-title":"Annals OR"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-319-10428-7_56","volume-title":"Principles and Practice of Constraint Programming","author":"M Bofill","year":"2014","unstructured":"Bofill, M., Espasa, J., Garcia, M., Palah\u00ed, M., Suy, J., Villaret, M.: Scheduling B2B meetings. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 781\u2013796. Springer, Heidelberg (2014)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-10428-7_17","volume-title":"Principles and Practice of Constraint Programming","author":"M Bofill","year":"2014","unstructured":"Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving intensional weighted CSPs by incremental optimization with BDDs. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 207\u2013223. Springer, Heidelberg (2014)"},{"key":"5_CR5","unstructured":"Demirovi\u0107, E., Musliu, N.: Modeling high school timetablingas partial weighted MaxSAT. In: LaSh: The 4th Workshop on Logic and Search (a SAT \/ ICLP workshop at FLoC 2014). Austria, Vienna (2014)"},{"key":"5_CR6","unstructured":"Dutertre, B., de Moura, L.: The Yices SMT solver. Tool paper, August 2006. http:\/\/yices.csl.sri.com\/tool-paper.pdf (Accessed 23 November 2014)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-40564-8_34","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2013","unstructured":"Gebser, M., Glase, T., Sabuncu, O., Schaub, T.: Matchmaking with answer set programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 342\u2013347. Springer, Heidelberg (2013)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260\u2013265. Springer, Heidelberg (2007)"},{"key":"5_CR9","unstructured":"Klieber, W., Kwon, G.: Efficient CNF encoding for selecting 1 from N objects. In: Fourth Workshop on Constraints in Formal Verification, CFV (2007)"},{"issue":"1\/2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.3233\/SAT190091","volume":"8","author":"M Koshimura","year":"2012","unstructured":"Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: A Partial Max-SAT Solver. Journal on Satisfiability, Boolean Modeling and Computation 8(1\/2), 95\u2013100 (2012)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"5_CR11","unstructured":"Li, C.M., Many\u00e0, F.: Handbook of Satisfiability, chapter MaxSAT, Hard and Soft Constraints, pp. 613\u2013631. IOS Press (2009)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal cnf encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T20:03:07Z","timestamp":1609358587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}