{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:11:30Z","timestamp":1756894290479,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031605963"},{"type":"electronic","value":"9783031605970"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60597-0_10","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"136-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bi-objective Discrete Graphical Model Optimization"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Buchet","sequence":"first","affiliation":[]},{"given":"David","family":"Allouche","sequence":"additional","affiliation":[]},{"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-319-23219-5_2","volume-title":"Principles and Practice of Constraint Programming","author":"D Allouche","year":"2015","unstructured":"Allouche, D., de Givry, S., Katsirelos, G., Schiex, T., Zytnicki, M.: Anytime hybrid best-first search with tree decomposition for weighted CSP. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 12\u201329. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_2"},{"key":"10_CR2","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":"10_CR3","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."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Manage. Sci. 25(1), 73\u201378 (1979)","journal-title":"Manage. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bau\u00df, J., Stiglmayr, M.: Augmenting bi-objective branch and bound by scalarization-based information. arXiv preprint arXiv:2301.11974 (2023)","DOI":"10.1007\/s00186-024-00854-3"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10601-006-9001-9","volume":"11","author":"C Bessiere","year":"2006","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the NValue constraint. Constraints 11, 271\u2013293 (2006)","journal-title":"Constraints"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1026441215081","volume":"4","author":"S Bistarelli","year":"1999","unstructured":"Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs: frameworks, properties and comparison. Constraints 4, 199\u2013240 (1999)","journal-title":"Constraints"},{"key":"10_CR8","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, vol.\u00a016, p.\u00a0146 (2004)"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1080\/07468342.1986.11972974","volume":"17","author":"B Braden","year":"1986","unstructured":"Braden, B.: The surveyor\u2019s area formula. Coll. Math. J. 17(4), 326\u2013337 (1986)","journal-title":"Coll. Math. J."},{"key":"10_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 J. 4, 79\u201389 (1999)","journal-title":"Constraints J."},{"key":"10_CR11","unstructured":"Cerqueus, A.: Bi-objective branch-and-cut algorithms applied to the binary knapsack problem. Ph.D. thesis, universit\u00e9 de Nantes (2015). https:\/\/hal.science\/tel-01242210"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10732-017-9346-9","volume":"23","author":"A Cerqueus","year":"2017","unstructured":"Cerqueus, A., Gandibleux, X., Przybylski, A., Saubion, F.: On branching heuristics for the bi-objective 0\/1 unidimensional knapsack problem. J. Heuristics 23, 285\u2013319 (2017)","journal-title":"J. Heuristics"},{"issue":"7\u20138","key":"10_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"M Cooper","year":"2010","unstructured":"Cooper, M., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artif. Intell. 174(7\u20138), 449\u2013478 (2010)","journal-title":"Artif. Intell."},{"key":"10_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"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Defresne, M., Barbe, S., Schiex, T.: Scalable coupling of deep learning with logical reasoning. In: Proceedings of the 32$$^{nd}$$ IJCAI, Macau, A.S.R., China (2023)","DOI":"10.24963\/ijcai.2023\/402"},{"key":"10_CR16","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-1-4939-3094-4_19","volume-title":"Multiple Criteria Decision Analysis","author":"M Ehrgott","year":"2016","unstructured":"Ehrgott, M., Gandibleux, X., Przybylski, A.: Exact methods for multi-objective combinatorial optimisation. In: Greco, S., Ehrgott, M., Figueira, J.R. (eds.) Multiple Criteria Decision Analysis. ISORMS, vol. 233, pp. 817\u2013850. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-3094-4_19"},{"key":"10_CR17","unstructured":"Favier, A., de\u00a0Givry, S., Legarra, A., Schiex, T.: Pairwise decomposition for combinatorial optimization in graphical models. In: Proceedings of IJCAI-11, Barcelona, Spain (2011)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-40627-0_22","volume-title":"Principles and Practice of Constraint Programming","author":"S de Givry","year":"2013","unstructured":"de Givry, S., Prestwich, S.D., O\u2019Sullivan, B.: Dead-end elimination for weighted CSP. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 263\u2013272. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_22"},{"key":"10_CR19","unstructured":"de\u00a0Givry, S., Zytnicki, M., Heras, F., 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)"},{"issue":"5\u20136","key":"10_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/mcda.1780","volume":"29","author":"P Halffmann","year":"2022","unstructured":"Halffmann, P., Sch\u00e4fer, L.E., D\u00e4chert, K., Klamroth, K., Ruzika, S.: Exact algorithms for multiobjective linear optimization problems with integer variables: a state of the art survey. J. Multi-Criteria Decis. Anal. 29(5\u20136), 341\u2013363 (2022)","journal-title":"J. Multi-Criteria Decis. Anal."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Hartert, R., Schaus, P.: A support-based algorithm for the bi-objective pareto constraint. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a028 (2014)","DOI":"10.1609\/aaai.v28i1.9119"},{"key":"10_CR22","unstructured":"Hurley, B., et al.: Multi-language evaluation of exact solvers in graphical model discrete optimization (summary). In: Proceedings of CP-AI-OR 2016, Banff, Canada, p. 1 (2016)"},{"key":"10_CR23","unstructured":"Jabs, C., Berg, J., Ihalainen, H., J\u00e4rvisalo, M.: Preprocessing in SAT-based multi-objective combinatorial optimization. In: Proceedings of CP-23, Toronto, Canada (2023)"},{"key":"10_CR24","unstructured":"Jabs, C., Berg, J., Niskanen, A., J\u00e4rvisalo, M.: MaxSAT-based bi-objective Boolean optimization. In: 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (2022)"},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica, J., To\u0161ic, D., Filipovi\u0107, V., Ljubi\u0107, I.: Solving the simple plant location problem by genetic algorithm. RAIRO-Oper. Res. 35(1), 127\u2013142 (2001)","journal-title":"RAIRO-Oper. Res."},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45349-0_22","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"J Larrosa","year":"2000","unstructured":"Larrosa, J.: Boosting search with variable elimination. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 291\u2013305. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45349-0_22"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"102537","DOI":"10.1016\/j.sbi.2023.102537","volume":"79","author":"S Luukkonen","year":"2023","unstructured":"Luukkonen, S., van den Maagdenberg, H.W., Emmerich, M.T., van Westen, G.J.: Artificial intelligence in multi-objective drug design. Curr. Opin. Struct. Biol. 79, 102537 (2023)","journal-title":"Curr. Opin. Struct. Biol."},{"key":"10_CR28","unstructured":"Malalel, S., Malapert, A., Pelleau, M., R\u00e9gin, J.C.: MDD archive for boosting the pareto constraint. In: 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-031-33271-5_27","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"P Montalbano","year":"2023","unstructured":"Montalbano, P., Allouche, D., de Givry, S., Katsirelos, G., Werner, T.: Virtual pairwise consistency in cost function networks. In: Cire, A.A. (ed.) CPAIOR 2023. LNCS, vol. 13884, pp. 417\u2013426. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33271-5_27"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-031-08011-1_19","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"P Montalbano","year":"2022","unstructured":"Montalbano, P., de Givry, S., Katsirelos, G.: Multiple-choice knapsack constraint in graphical models. In: Schaus, P. (ed.) CPAIOR 2022. LNCS, vol. 13292, pp. 282\u2013299. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08011-1_19"},{"issue":"3","key":"10_CR31","doi-asserted-by":"publisher","first-page":"e427","DOI":"10.1016\/j.ddtec.2013.02.001","volume":"10","author":"CA Nicolaou","year":"2013","unstructured":"Nicolaou, C.A., Brown, N.: Multi-objective optimization methods in drug design. Drug Discov. Today Technol. 10(3), e427\u2013e435 (2013)","journal-title":"Drug Discov. Today Technol."},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1107\/S205225251801480X","volume":"6","author":"H Noguchi","year":"2019","unstructured":"Noguchi, H., et al.: Computational design of symmetrical eight-bladed $$\\beta $$-propeller proteins. IUCrJ 6(1), 46\u201355 (2019)","journal-title":"IUCrJ"},{"key":"10_CR33","unstructured":"o\u2019Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1998)"},{"key":"10_CR34","first-page":"9613","volume":"34","author":"T Rahman","year":"2021","unstructured":"Rahman, T., Rouhani, S., Gogate, V.: Novel upper bounds for the constrained most probable explanation task. Adv. Neural. Inf. Process. Syst. 34, 9613\u20139624 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"10_CR35","unstructured":"Rollon, E., Larrosa, J.: Multi-objective propagation in constraint programming. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI 2006, 17th European Conference on Artificial Intelligence Proceedings. Frontiers in Artificial Intelligence and Applications, vol.\u00a0141, pp. 128\u2013132. IOS Press (2006)"},{"key":"10_CR36","unstructured":"Rollon, E., Larrosa, J.: Constraint optimization techniques for multiobjective branch and bound search. In: International conference on logic programming, ICLP (2008)"},{"key":"10_CR37","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"},{"issue":"12","key":"10_CR38","doi-asserted-by":"publisher","first-page":"5980","DOI":"10.1021\/acs.jctc.5b00594","volume":"11","author":"D Simoncini","year":"2015","unstructured":"Simoncini, D., Allouche, D., De Givry, S., Delmas, C., Barbe, S., Schiex, T.: Guaranteed discrete energy optimization on large protein design problems. J. Chem. Theory Comput. 11(12), 5980\u20135989 (2015)","journal-title":"J. Chem. Theory Comput."},{"issue":"17","key":"10_CR39","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"},{"issue":"2","key":"10_CR40","first-page":"149","volume":"20","author":"EL Ulungu","year":"1995","unstructured":"Ulungu, E.L., Teghem, J.: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found. Comput. Decis. Sci. 20(2), 149\u2013165 (1995)","journal-title":"Found. Comput. Decis. Sci."},{"issue":"2","key":"10_CR41","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e, M., Teghem, J., Pirlot, M., Ulungu, E.L.: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Global Optim. 12(2), 139\u2013155 (1998)","journal-title":"J. Global Optim."},{"issue":"1","key":"10_CR42","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1093\/bioinformatics\/btz497","volume":"36","author":"J Vucinic","year":"2020","unstructured":"Vucinic, J., Simoncini, D., Ruffini, M., Barbe, S., Schiex, T.: Positive multistate protein design. Bioinformatics 36(1), 122\u2013130 (2020)","journal-title":"Bioinformatics"},{"issue":"39","key":"10_CR43","doi-asserted-by":"publisher","first-page":"15998","DOI":"10.1021\/jacs.1c05367","volume":"143","author":"S Yagi","year":"2021","unstructured":"Yagi, S., et al.: Seven amino acid types suffice to create the core fold of RNA polymerase. J. Am. Chem. Soc. 143(39), 15998\u201316006 (2021)","journal-title":"J. Am. Chem. Soc."}],"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-60597-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:06:03Z","timestamp":1716818763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","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 the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}