{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:19:14Z","timestamp":1766067554288,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031080104"},{"type":"electronic","value":"9783031080111"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_19","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"282-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multiple-choice Knapsack Constraint in Graphical Models"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8126-892X","authenticated-orcid":false,"given":"Pierre","family":"Montalbano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2242-0458","authenticated-orcid":false,"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3727-6698","authenticated-orcid":false,"given":"George","family":"Katsirelos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-030-45223-0_4","volume-title":"Operations Research and Simulation in Healthcare","author":"D Allouche","year":"2021","unstructured":"Allouche, D., et al.: Cost function networks to solve large computational protein design problems. In: Masmoudi, M., Jarboui, B., Siarry, P. (eds.) Operations Research and Simulation in Healthcare, pp. 81\u2013102. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-45223-0_4"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.artint.2016.06.005","volume":"238","author":"D Allouche","year":"2016","unstructured":"Allouche, D., et al.: Tractability-preserving transformations of global cost functions. Artif. Intell. 238, 166\u2013189 (2016)","journal-title":"Artif. Intell."},{"key":"19_CR3","unstructured":"Allouche, D., et al.: Filtering decomposable global cost functions. In: Proceedings of AAAI-12. Toronto, Canada (2012)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.artint.2014.03.005","volume":"212","author":"D Allouche","year":"2014","unstructured":"Allouche, D., et al.: Computational protein design as an optimization problem. Artif. Intell. 212, 59\u201379 (2014)","journal-title":"Artif. Intell."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-30048-7_2","volume-title":"Principles and Practice of Constraint Programming","author":"C Ans\u00f3tegui","year":"2019","unstructured":"Ans\u00f3tegui, C., et al.: Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 20\u201336. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_2"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli, A., Cacchiani, V., Malaguti, E.: A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J. Comput. 29(3), 457\u2013473 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"7","key":"19_CR7","doi-asserted-by":"publisher","first-page":"5157","DOI":"10.1007\/s10462-020-09817-6","volume":"53","author":"M Bofill","year":"2020","unstructured":"Bofill, M., Coll, J., Suy, J., Villaret, M.: An MDD-based SAT encoding for pseudo-boolean constraints with at-most-one relations. Artif. Intell. Rev. 53(7), 5157\u20135188 (2020)","journal-title":"Artif. Intell. Rev."},{"key":"19_CR8","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, vol. 16, p. 146 (2004)"},{"key":"19_CR9","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI-04, vol. 16, p. 146 (2004)"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B Cabon","year":"1999","unstructured":"Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.: Radio link frequency assignment. Constraints 4(1), 79\u201389 (1999)","journal-title":"Constraints"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2020.07.023","volume":"289","author":"S Coniglio","year":"2021","unstructured":"Coniglio, S., Furini, F., San Segundo, P.: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. Eur. J. Oper. Res. 289(2), 435\u2013455 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"7\u20138","key":"19_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"MC Cooper","year":"2010","unstructured":"Cooper, M.C., de Givry, S., S\u00e1nchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artif. Intell. 174(7\u20138), 449\u2013478 (2010)","journal-title":"Artif. Intell."},{"key":"19_CR13","unstructured":"Cooper, M.C., de Givry, S., Schiex, T.: Graphical models: queries, complexity, algorithms (tutorial). In: Proceedings of 37th International Symposium on Theoretical Aspects of Computer Science (STACS-20). LIPIcs, vol. 154, pp. 4:1\u20134:22. Montpellier, France (2020)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-06167-8_7","volume-title":"A Guided Tour of Artificial Intelligence Research","author":"MC Cooper","year":"2020","unstructured":"Cooper, M.C., de Givry, S., Schiex, T.: Valued constraint satisfaction problems. In: Marquis, P., Papini, O., Prade, H. (eds.) A Guided Tour of Artificial Intelligence Research, pp. 185\u2013207. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-06167-8_7"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/636865.636866","volume":"50","author":"R Dechter","year":"2003","unstructured":"Dechter, R., Rish, I.: Mini-buckets: a general scheme for bounded inference. J. ACM (JACM) 50(2), 107\u2013153 (2003)","journal-title":"J. ACM (JACM)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-58475-7_11","volume-title":"Principles and Practice of Constraint Programming","author":"T Dlask","year":"2020","unstructured":"Dlask, T., Werner, T.: Bounding linear programs by constraint propagation: application to max-SAT. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 177\u2013193. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_11"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-030-58475-7_12","volume-title":"Principles and Practice of Constraint Programming","author":"T Dlask","year":"2020","unstructured":"Dlask, T., Werner, T.: On relation between constraint propagation and block-coordinate descent in linear programs. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 194\u2013210. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_12"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02591729","volume":"29","author":"ME Dyer","year":"1984","unstructured":"Dyer, M.E.: An $$o(n)$$ algorithm for the multiple-choice knapsack linear program. Math. Program. 29(1), 57\u201363 (1984)","journal-title":"Math. Program."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Elffers, J., Nordstr\u00f6m, J.: Divide and conquer: towards faster pseudo-boolean solving. In: Proceedings of IJCAI, Stockholm, Sweden, pp. 1291\u20131299 (2018)","DOI":"10.24963\/ijcai.2018\/180"},{"key":"19_CR20","unstructured":"de Givry, S., Schiex, T., Verfaillie, G.: Exploiting tree decomposition and soft local consistency in weighted CSP. In: Proceedings of AAAI-06, Boston, MA (2006)"},{"key":"19_CR21","unstructured":"de Givry, S., Heras, F., Zytnicki, M., Larrosa, J.: Existential arc consistency: getting closer to full arc consistency in weighted CSPs. In: Proceedings of IJCAI-05, Edinburgh, Scotland, pp. 84\u201389 (2005)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-66158-2_7","volume-title":"Principles and Practice of Constraint Programming","author":"S de Givry","year":"2017","unstructured":"de Givry, S., Katsirelos, G.: Clique cuts in weighted constraint satisfaction. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 97\u2013113. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_7"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Haller, S., Swoboda, P., Savchynskyy, B.: Exact map-inference by confining combinatorial search with LP relaxation. In: Proceedings of AAAI-18, New Orleans, Louisiana, USA, pp. 6581\u20136588 (2018)","DOI":"10.1609\/aaai.v32i1.12202"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","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":"E Hebrard","year":"2017","unstructured":"Hebrard, E., Siala, M.: Explanation-based weighted degree. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 167\u2013175. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_13"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10601-016-9245-y","volume":"21","author":"B Hurley","year":"2016","unstructured":"Hurley, B., et al.: Multi-language evaluation of exact solvers in graphical model discrete optimization. Constraints 21(3), 413\u2013434 (2016). https:\/\/doi.org\/10.1007\/s10601-016-9245-y","journal-title":"Constraints"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Jo Devriendt, A.G., Nordstr\u00f6m, J.: Learn to relax: integrating 0\u20131 integer linear programming with pseudo-boolean conflict-driven search. In: Proceedings of CP-AI-OR 2020, Vienna, Austria (2020)","DOI":"10.1007\/s10601-020-09318-x"},{"issue":"1","key":"19_CR27","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","volume":"1","author":"EL Johnson","year":"1981","unstructured":"Johnson, E.L., Padberg, M.W.: A note of the knapsack problem with special ordered sets. Oper. Res. Lett. 1(1), 18\u201322 (1981)","journal-title":"Oper. Res. Lett."},{"key":"19_CR28","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)"},{"issue":"10","key":"19_CR29","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"19_CR30","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TPAMI.2010.108","volume":"33","author":"N Komodakis","year":"2010","unstructured":"Komodakis, N., Paragios, N., Tziritas, G.: MRF energy minimization and beyond via dual decomposition. IEEE Trans. Pattern Anal. Mach. Intell. 33(3), 531\u2013552 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR31","unstructured":"Larrosa, J.: On arc and node consistency in weighted CSP. In: Proceedings of AAAI 2002, Edmondton, CA, pp. 48\u201353 (2002)"},{"key":"19_CR32","unstructured":"Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted CSP. In: Proceedings of IJCAI-03, vol. 3, pp. 239\u2013244 (2003)"},{"key":"19_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1613\/jair.3476","volume":"43","author":"JHM Lee","year":"2012","unstructured":"Lee, J.H.M., Leung, K.L.: Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction. J. Artif. Intell. Res. 43, 257\u2013292 (2012)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"19_CR34","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s10601-014-9159-5","volume":"19","author":"JH Lee","year":"2014","unstructured":"Lee, J.H., Leung, K.L., Shum, Y.W.: Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction. Constraints 19(3), 270\u2013308 (2014)","journal-title":"Constraints"},{"key":"19_CR35","unstructured":"Lee, J.H., Leung, K.L., Wu, Y.: Polynomially decomposable global cost functions in weighted constraint satisfaction. In: Proceedings of AAAI-12, Toronto, Canada (2012)"},{"key":"19_CR36","unstructured":"Marinescu, R., Dechter, R.: AND\/OR branch-and-bound for graphical models. In: Proceedings of IJCAI-05, Edinburgh, Scotland, pp. 224\u2013229 (2005)"},{"key":"19_CR37","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-1-4613-0303-9_5","volume-title":"Handbook of Combinatorial Optimization","author":"D Pisinger","year":"1998","unstructured":"Pisinger, D., Toth, P.: Knapsack problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 299\u2013428. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_5"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Prusa, D., Werner, T.: Universality of the local marginal polytope. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1738\u20131743 (2013)","DOI":"10.1109\/CVPR.2013.227"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Ruffini, M., Vucinic, J., de Givry, S., Katsirelos, G., Barbe, S., Schiex, T.: Guaranteed diversity & quality for the weighted CSP. In: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI), pp. 18\u201325. IEEE (2019)","DOI":"10.1109\/ICTAI.2019.00012"},{"issue":"6","key":"19_CR40","doi-asserted-by":"publisher","first-page":"168","DOI":"10.3390\/a14060168","volume":"4","author":"M Ruffini","year":"2021","unstructured":"Ruffini, M., Vucinic, J., de Givry, S., Katsirelos, G., Barbe, S., Schiex, T.: Guaranteed diversity and optimality in cost function network based computational protein design methods. Algorithms 4(6), 168 (2021)","journal-title":"Algorithms"},{"issue":"6","key":"19_CR41","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1587\/transinf.2014FOP0007","volume":"98","author":"M Sakai","year":"2015","unstructured":"Sakai, M., Nabeshima, H.: Construction of an ROBDD for a PB-constraint in band form and related techniques for PB-solvers. IEICE Trans. Inf. Syst. 98(6), 1121\u20131127 (2015)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"1","key":"19_CR42","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10601-007-9029-5","volume":"13","author":"M S\u00e1nchez","year":"2008","unstructured":"S\u00e1nchez, M., de Givry, S., Schiex, T.: Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints 13(1), 130\u2013154 (2008)","journal-title":"Constraints"},{"key":"19_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-45349-0_30","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"T Schiex","year":"2000","unstructured":"Schiex, T.: Arc consistency for soft constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 411\u2013425. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45349-0_30"},{"key":"19_CR44","first-page":"113","volume":"4","author":"M Schlesinger","year":"1976","unstructured":"Schlesinger, M.: Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (Syntactic analysis of two-dimensional visual signals in noisy conditions). Kibernetika 4, 113\u2013130 (1976)","journal-title":"Kibernetika"},{"key":"19_CR45","unstructured":"Sontag, D., Choe, D., Li, Y.: Efficiently searching for frustrated cycles in MAP inference. In: Proceedings of UAI, Catalina Island, CA, USA, pp. 795\u2013804 (2012)"},{"key":"19_CR46","unstructured":"Sontag, D., Meltzer, T., Globerson, A., Weiss, Y., Jaakkola, T.: Tightening LP relaxations for MAP using message-passing. In: Proceedings of UAI, Helsinki, Finland, pp. 503\u2013510 (2008)"},{"key":"19_CR47","unstructured":"Tourani, S., Shekhovtsov, A., Rother, C., Savchynskyy, B.: Taxonomy of dual block-coordinate ascent methods for discrete energy minimization. In: Proceedings of AISTATS 2020, Palermo, Sicily, Italy, pp. 2775\u20132785 (2020)"},{"issue":"17","key":"19_CR48","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1093\/bioinformatics\/btt374","volume":"29","author":"S Traor\u00e9","year":"2013","unstructured":"Traor\u00e9, S., et al.: A new framework for computational protein design through cost function network optimization. Bioinformatics 29(17), 2129\u20132136 (2013)","journal-title":"Bioinformatics"},{"key":"19_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-030-58942-4_31","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"F Tr\u00f6sser","year":"2020","unstructured":"Tr\u00f6sser, F., de Givry, S., Katsirelos, G.: Relaxation-aware heuristics for exact optimization in graphical models. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 475\u2013491. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_31"},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Vaidya, P.: Speeding-up linear programming using fast matrix multiplication. In: 30th Annual Symposium on Foundations of Computer Science, pp. 332\u2013337 (1989)","DOI":"10.1109\/SFCS.1989.63499"},{"issue":"7","key":"19_CR51","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T Werner","year":"2007","unstructured":"Werner, T.: A linear programming approach to max-sum problem: a review. IEEE Trans. Pattern Recogn. Mach. Intell. 29(7), 1165\u20131179 (2007)","journal-title":"IEEE Trans. Pattern Recogn. Mach. Intell."},{"issue":"3","key":"19_CR52","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(84)90014-0","volume":"18","author":"E Zemel","year":"1984","unstructured":"Zemel, E.: An $$o(n)$$ algorithm for the linear multiple choice knapsack problem and related problems. Inf. Process. Lett. 18(3), 123\u2013128 (1984)","journal-title":"Inf. Process. Lett."},{"key":"19_CR53","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1613\/jair.2797","volume":"35","author":"M Zytnicki","year":"2009","unstructured":"Zytnicki, M., Gaspin, C., de Givry, S., Schiex, T.: Bounds arc consistency for weighted CSPs. J. Artif. Intell. Res. 35, 593\u2013621 (2009)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:05:23Z","timestamp":1667912723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","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":"Los Angeles, CA","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","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":"60","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":"28","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":"47% - 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","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)"}}]}}