{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T12:43:30Z","timestamp":1755693810369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"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_4","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"57-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5566-5224","authenticated-orcid":false,"given":"David","family":"Bergman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1439-5205","authenticated-orcid":false,"given":"Carlos","family":"Cardonha","sequence":"additional","affiliation":[]},{"given":"Saharnaz","family":"Mehrani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-74970-7_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"HR Andersen","year":"2007","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 118\u2013132. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-74970-7_11"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00224-014-9538-8","volume":"56","author":"J Balogh","year":"2015","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Kellerer, H., Tuza, Z.: Online results for black and white bin packing. Theor. Comput. Syst. 56(1), 137\u2013155 (2015)","journal-title":"Theor. Comput. Syst."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-38016-7_12","volume-title":"Approximation and Online Algorithms","author":"J Balogh","year":"2013","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Dosa, G., Kellerer, H., Tuza, Z.: Black and white bin packing. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 131\u2013144. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38016-7_12"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10878-007-9123-z","volume":"16","author":"M Behle","year":"2008","unstructured":"Behle, M.: On threshold BDDs and the optimal variable ordering problem. J. Comb. Optim. 16(2), 107\u2013118 (2008). \n                    https:\/\/doi.org\/10.1007\/s10878-007-9123-z","journal-title":"J. Comb. Optim."},{"unstructured":"Bergman, D., Bodur, M., Cardonha, C., Cire, A.A.: Network models for multiobjective discrete optimization. \n                    arXiv:1802.08637\n                    \n                   (2018)","key":"4_CR5"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-33954-2_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A.: Decomposition based on decision diagrams. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 45\u201354. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-33954-2_4"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-44953-1_6","volume-title":"Principles and Practice of Constraint Programming","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A.: Multiobjective optimization by decision diagrams. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 86\u201395. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-44953-1_6"},{"issue":"10","key":"4_CR8","doi-asserted-by":"publisher","first-page":"4700","DOI":"10.1287\/mnsc.2017.2849","volume":"64","author":"D Bergman","year":"2018","unstructured":"Bergman, D., Cire, A.A.: Discrete nonlinear optimization by state-space decompositions. Manage. Sci. 64(10), 4700\u20134720 (2018). \n                    https:\/\/doi.org\/10.1287\/mnsc.2017.2849","journal-title":"Manage. Sci."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1287\/ijoc.2015.0648","volume":"28","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Discrete optimization with decision diagrams. INFORMS J. Comput. 28(1), 47\u201366 (2016). \n                    https:\/\/doi.org\/10.1287\/ijoc.2015.0648","journal-title":"INFORMS J. Comput."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-29828-8_3","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"D Bergman","year":"2012","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J., Hooker, J.N.: Variable ordering for the application of BDDs to the maximum independent set problem. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 34\u201349. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29828-8_3"},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., Van Hoeve, W.J., Hooker, J.: Decision Diagrams for Optimization. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-42849-9"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-21311-3_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D Bergman","year":"2011","unstructured":"Bergman, D., van Hoeve, W.-J., Hooker, J.N.: Manipulating MDD relaxations for combinatorial optimization. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 20\u201335. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-21311-3_5"},{"unstructured":"Bergman, D., Lozano, L.: Decision diagram decomposition for quadratically constrained binary optimization (2018)","key":"4_CR13"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-18263-6_4","volume-title":"Approximation and Online Algorithms","author":"M B\u00f6hm","year":"2015","unstructured":"B\u00f6hm, M., Sgall, J., Vesel\u00fd, P.: Online colored bin packing. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 35\u201346. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-18263-6_4"},{"issue":"8","key":"4_CR15","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). \n                    https:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"RE Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293\u2013318 (1992). \n                    https:\/\/doi.org\/10.1145\/136035.136043","journal-title":"ACM Comput. Surv."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/S1571-0653(04)00248-3","volume":"7","author":"M Dawande","year":"2001","unstructured":"Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable sized bin packing with color constraints. Electron. Notes Discrete Math. 7, 154\u2013157 (2001)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17(3), 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1287\/ijoc.1100.0406","volume":"23","author":"S Elhedhli","year":"2011","unstructured":"Elhedhli, S., Li, L., Gzara, M., Naoum-Sawaya, J.: A branch-and-price algorithm for the bin packing problem with conflicts. INFORMS J. Comput. 23(3), 404\u2013415 (2011)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","volume":"31","author":"M Gendreau","year":"2004","unstructured":"Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing problem with conflicts. Comput. Oper. Res. 31(3), 347\u2013358 (2004)","journal-title":"Comput. Oper. Res."},{"unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual (2018). \n                    http:\/\/www.gurobi.com","key":"4_CR21"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-85958-1_30","volume-title":"Principles and Practice of Constraint Programming","author":"T Hadzic","year":"2008","unstructured":"Hadzic, T., Hooker, J.N., O\u2019Sullivan, B., Tiedemann, P.: Approximate compilation of constraints into multivalued decision diagrams. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 448\u2013462. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-85958-1_30"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K Jansen","year":"1999","unstructured":"Jansen, K.: An approximation scheme for bin packing with conflicts. J. Comb. Optim. 3(4), 363\u2013377 (1999)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K Jansen","year":"1997","unstructured":"Jansen, K., \u00d6hring, S.: Approximation algorithms for time constrained scheduling. Inf. Comput. 132(2), 85\u2013108 (1997)","journal-title":"Inf. Comput."},{"key":"4_CR25","series-title":"The IBM Research Symposia Series","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. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). \n                    https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.endm.2017.03.006","volume":"58","author":"Y Kochetov","year":"2017","unstructured":"Kochetov, Y., Kondakov, A.: VNS matheuristic for a bin packing problem with a color constraint. Electron. Notes Discrete Math. 58, 39\u201346 (2017)","journal-title":"Electron. Notes Discrete Math."},{"key":"4_CR27","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-93800-4_25","volume-title":"Optimization Problems and Their Applications","author":"A Kondakov","year":"2018","unstructured":"Kondakov, A., Kochetov, Y.: A core heuristic and the branch-and-price method for a bin packing problem with a color constraint. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds.) OPTA 2018. CCIS, vol. 871, pp. 309\u2013320. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-93800-4_25"},{"unstructured":"Lozano, L., Bergman, D., Smith, J.C.: On the consistent path problem (2018)","key":"4_CR28"},{"unstructured":"Matsumoto, K., Hatano, K., Takimoto, E.: Decision diagrams for solving a job scheduling problem under precedence constraints. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 103. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Saarbr\u00fccken (2018)","key":"4_CR29"},{"unstructured":"Miller, D.M., Drechsler, R.: Implementing a multiple-valued decision diagram package. In: Proceedings of the 28th IEEE International Symposium on Multiple-Valued Logic, pp. 52\u201357. IEEE (1998)","key":"4_CR30"},{"issue":"3","key":"4_CR31","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/ijoc.1090.0355","volume":"22","author":"AEF Muritiba","year":"2010","unstructured":"Muritiba, A.E.F., Iori, M., Malaguti, E., Toth, P.: Algorithms for the bin packing problem with conflicts. INFORMS J. Comput. 22(3), 401\u2013415 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"4_CR32","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1287\/opre.1040.0112","volume":"52","author":"M Peeters","year":"2004","unstructured":"Peeters, M., Degraeve, Z.: The co-printing problem: a packing problem with a color constraint. Oper. Res. 52(4), 623\u2013638 (2004)","journal-title":"Oper. Res."},{"unstructured":"Raghunathan, A.U., Bergman, D., Hooker, J., Serra, T., Kobori, S.: Seamless multimodal transportation scheduling (2018)","key":"4_CR33"},{"issue":"2","key":"4_CR34","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/ijoc.1120.0499","volume":"25","author":"R Sadykov","year":"2013","unstructured":"Sadykov, R., Vanderbeck, F.: Bin packing with conflicts: a generic branch-and-price algorithm. INFORMS J. Comput. 25(2), 244\u2013255 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"4_CR35","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jos.86","volume":"4","author":"H Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. J. Sched. 4(6), 313\u2013338 (2001)","journal-title":"J. Sched."},{"issue":"1","key":"4_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2003.05.006","volume":"321","author":"H Shachnai","year":"2004","unstructured":"Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theoret. Comput. Sci. 321(1), 103\u2013123 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"4_CR37","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"MA Trick","year":"2003","unstructured":"Trick, M.A.: A dynamic programming approach for consistency and propagation for knapsack constraints. Ann. Oper. Res. 118(1), 73\u201384 (2003). \n                    https:\/\/doi.org\/10.1023\/A:1021801522545","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"4_CR38","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2008.01.001","volume":"393","author":"EC Xavier","year":"2008","unstructured":"Xavier, E.C., Miyazawa, F.K.: The class constrained bin packing problem with applications to video-on-demand. Theoret. Comput. Sci. 393(1\u20133), 240\u2013259 (2008)","journal-title":"Theoret. Comput. Sci."}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:08:49Z","timestamp":1558984129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_4","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"}}]}}