{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:00:00Z","timestamp":1780632000360,"version":"3.54.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,4,22]],"date-time":"2016-04-22T00:00:00Z","timestamp":1461283200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["10\/IN.1\/I3032"],"award-info":[{"award-number":["10\/IN.1\/I3032"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10601-016-9245-y","type":"journal-article","created":{"date-parts":[[2016,4,22]],"date-time":"2016-04-22T10:07:43Z","timestamp":1461319663000},"page":"413-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Multi-language evaluation of exact solvers in graphical model discrete optimization"],"prefix":"10.1007","volume":"21","author":[{"given":"Barry","family":"Hurley","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Allouche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Katsirelos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Zytnicki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon de","family":"Givry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"9245_CR1","unstructured":"Allouche, D., Bessiere, C., Boizumault, P., Givry, S., Gutierrez, P., Loudni, S., M\u00e9tivier, J., & Schiex, T. (2012). Decomposing global cost functions. In Proceedings of AAAI."},{"key":"9245_CR2","doi-asserted-by":"crossref","unstructured":"Allouche, D., de Givry, S., Katsirelos, G., Schiex, T., & Zytnicki, M. (2015). Anytime hybrid best-first search with tree decomposition for weighted CSP. In Proceedings of CP (pp. 12\u201328).","DOI":"10.1007\/978-3-319-23219-5_2"},{"key":"9245_CR3","doi-asserted-by":"crossref","unstructured":"Allouche, D., Traor\u00e9, S., Andr\u00e9, I., Givry, S., Katsirelos, G., Barbe, S., & Schiex, T. (2012). Computational protein design as a cost function network optimization problem. In Proceedings of CP (pp. 840\u2013849).","DOI":"10.1007\/978-3-642-33558-7_60"},{"key":"9245_CR4","unstructured":"Amadini, R., Gabbrielli, M., & Mauro, J. (2015). A Multicore Tool for Constraint Solving. In Proceedings of IJCAI (pp. 232\u2013238)."},{"key":"9245_CR5","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., & Sellmann, M. (2014). MaxSAT by Improved Instance-Specific Algorithm Configuration. In Proceedings of AAAI (pp. 2594\u20132600).","DOI":"10.1609\/aaai.v28i1.9128"},{"key":"9245_CR6","doi-asserted-by":"crossref","unstructured":"Argelich, J., Cabiscol, A., Lynce, I., & Many\u00e0, F. (2008). Encoding Max-CSP into partial Max-SAT. In Proceedings of ISMVL (pp. 106\u2013111).","DOI":"10.1109\/ISMVL.2008.22"},{"key":"9245_CR7","doi-asserted-by":"crossref","unstructured":"Bacchus, F. (2007). GAC via unit propagation. In Proceedings of CP (pp. 133\u2013147).","DOI":"10.1007\/978-3-540-74970-7_12"},{"issue":"3","key":"9245_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E Bensana","year":"1999","unstructured":"Bensana, E., Lema\u00eetre, M., & Verfaillie, G. (1999). Earth observation satellite management. Constraints, 4(3), 293\u2013299.","journal-title":"Constraints"},{"key":"9245_CR9","unstructured":"Breiman, L., Friedman, J., Stone, C.J., & Olshen, R.A. (1984). Classification and regression trees: CRC press."},{"key":"9245_CR10","doi-asserted-by":"crossref","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. (1999). Radio link frequency assignment. Constraints, 4, 79\u201389.","journal-title":"Constraints"},{"key":"9245_CR11","doi-asserted-by":"crossref","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. (2010). Soft arc consistency revisited. Artificial Intelligence, 174, 449\u2013478.","journal-title":"Artificial Intelligence"},{"key":"9245_CR12","unstructured":"Cooper, M., de Givry, S., & Schiex, T. (2007). Optimal soft arc consistency. In Proceedings of IJCAI (pp. 68\u201373)."},{"issue":"1-2","key":"9245_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.artint.2003.09.002","volume":"154","author":"MC Cooper","year":"2004","unstructured":"Cooper, M.C., & Schiex, T. (2004). Arc consistency for soft constraints. Artificial Intelligence, 154(1-2), 199\u2013227.","journal-title":"Artificial Intelligence"},{"key":"9245_CR14","doi-asserted-by":"crossref","unstructured":"Davies, J., & Bacchus, F. (2011). Solving MAXSAT by solving a sequence of simpler SAT instances. In Proceedings of CP (pp. 225\u2013239).","DOI":"10.1007\/978-3-642-23786-7_19"},{"key":"9245_CR15","doi-asserted-by":"crossref","unstructured":"Davies, J., & Bacchus, F. (2013). Exploiting the power of MIP solvers in MaxSAT. In Proceedings of SAT (pp. 166\u2013181).","DOI":"10.1007\/978-3-642-39071-5_13"},{"issue":"1\u20132","key":"9245_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R Dechter","year":"1999","unstructured":"Dechter, R. (1999). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1\u20132), 41\u201385.","journal-title":"Artificial Intelligence"},{"key":"9245_CR17","unstructured":"Fargier, H., Lang, J., Martin-Clouaire, R., & Schiex, T. (1995). A constraint satisfaction framework for decision under uncertainty. In Proceedings of the 11th International Conference on Uncertainty in Artificial Intelligence. Montr\u00e9al."},{"key":"9245_CR18","unstructured":"Favier, A., Givry, S., Legarra, A., & Schiex, T. (2011). Pairwise decomposition for combinatorial optim. in graphical models. In Proceedings of IJCAI (pp. 2126\u20132132)."},{"key":"9245_CR19","doi-asserted-by":"crossref","unstructured":"de Givry, S., Prestwich, S., & O\u2019Sullivan, B. (2013). Dead-end elimination for weighted CSP. In Proceedings of CP (pp. 263\u2013272).","DOI":"10.1007\/978-3-642-40627-0_22"},{"key":"9245_CR20","unstructured":"Globerson, A., & Jaakkola, T. (2007). Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In Proceedings of NIPS (pp. 553\u2013560)."},{"issue":"1-2","key":"9245_CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., & Selman, B. (2001). Algorithm Portfolios. Artificial Intelligence, 126(1-2), 43\u201362.","journal-title":"Artificial Intelligence"},{"key":"9245_CR22","doi-asserted-by":"crossref","unstructured":"Hebrard, E., O\u2019Mahony, E., & O\u2019Sullivan, B. (2010). Constraint Programming and Combinatorial Optimisation in Numberjack. In Proceedings of CP-AI-OR (pp. 181\u2013185).","DOI":"10.1007\/978-3-642-13520-0_22"},{"issue":"5296","key":"9245_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"BA Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., & Hogg, T. (1997). An economics approach to hard computational problems. Science, 275(5296), 51\u201354.","journal-title":"Science"},{"key":"9245_CR24","doi-asserted-by":"crossref","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., & O\u2019Sullivan, B. (2014). Proteus: A hierarchical portfolio of solvers and transformations. In Proceedings of CP-AI-OR (pp. 301\u2013317).","DOI":"10.1007\/978-3-319-07046-9_22"},{"key":"9245_CR25","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., & Wolsey, L. (Eds.) (2010). 50 years of integer programming 1958\u20132008: Springer.","DOI":"10.1007\/978-3-540-68279-0"},{"key":"9245_CR26","doi-asserted-by":"crossref","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., & Tierney, K. (2010). ISAC \u2013 Instance-specific algorithm configuration. In Proceedings of ECAI (pp. 751\u2013756).","DOI":"10.3233\/978-1-60750-606-5-751"},{"issue":"2","key":"9245_CR27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s11263-015-0809-x","volume":"115","author":"J Kappes","year":"2015","unstructured":"Kappes, J., Andres, B., Hamprecht, F., Schno\u0307rr, C., Nowozin, S., Batra, D., Kim, S., Kausler, B., Kro\u0307ger, T., Lellmann, J., Komodakis, N., Savchynskyy, B., & Rother, C. (2015). A comparative study of modern inference techniques for structured discrete energy minimization problems. International Journal of Computer Vision, 115(2), 155\u2013184.","journal-title":"International Journal of Computer Vision"},{"key":"9245_CR28","unstructured":"Kishimoto, A., & Marinescu, R. (2013). Recursive best-first and\/or search with overestimation for genetic linkage analysis. In Proceedings of CP workshop on constraint based methods for bioinformatics."},{"key":"9245_CR29","unstructured":"Koller, D., & Friedman, N. (2009). Probabilistic graphical models: Principles and techniques: The MIT Press."},{"key":"9245_CR30","unstructured":"Koster, A. (1999). Frequency assignment: Models and algorithms. Ph.D. thesis."},{"key":"9245_CR31","unstructured":"Kotthoff, L. (2013). LLAMA: leveraging learning to automatically manage algorithms. Tech. Rep. arXiv: 1306.1031 ."},{"issue":"3","key":"9245_CR32","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L. (2014). Algorithm Selection for combinatorial search problems: a survey. AI Magazine, 35(3), 48\u201360.","journal-title":"AI Magazine"},{"issue":"1","key":"9245_CR33","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica, J., Tos\u0307ic, D., Filipovi\u0107, V., & Ljubi\u0107, I. (2001). Solving the simple plant location problem by genetic alg. RAIRO, 35(1), 127\u2013142.","journal-title":"RAIRO"},{"key":"9245_CR34","unstructured":"Larrosa, J, de Givry, S., Heras, F., & Zytnicki, M. (2005). Existential arc consistency: getting closer to full arc consistency in weighted CSPs. In Proceedings of IJCAI (pp. 84\u201389)."},{"issue":"2-3","key":"9245_CR35","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","volume":"172","author":"J Larrosa","year":"2008","unstructured":"Larrosa, J., Heras, F, & de Givry, S. (2008). A logical approach to efficient max-sat solving. Artificial Intelligence, 172(2-3), 204\u2013233.","journal-title":"Artificial Intelligence"},{"key":"9245_CR36","unstructured":"Li, C.M., & Many\u00e0, F. (2009). Maxsat. In Handbook of satisfiability, chap. 19: IOS Press."},{"key":"9245_CR37","unstructured":"Meltzer, T., Globerson, A., & Weiss, Y. (2009). Convergent message passing algorithms: a unifying view. In Proceedings of the twenty-fifth conference on uncertainty in artificial intelligence (pp. 393\u2013401): AUAI Press."},{"key":"9245_CR38","doi-asserted-by":"crossref","unstructured":"Meseguer, P., Rossi, F., & Schiex, T. (2006). Soft constraints processing. In Rossi, F., van Beek, P., & Walsh, T. (Eds.) Handbook of constraint programming, chap. 9: Elsevier.","DOI":"10.1016\/S1574-6526(06)80013-1"},{"key":"9245_CR39","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P., Becket, R., Brand, S., Duck, G., & Tack, G. (2007). MiniZinc: Towards a standard CP modelling language, (pp. 529\u2013543).","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9245_CR40","doi-asserted-by":"crossref","unstructured":"Neveu, B., Trombettoni, G., & Glover, F. (2004). Id walk: A candidate list strategy with a simple diversification device. In Proceedings of CP (pp. 423\u2013437).","DOI":"10.1007\/978-3-540-30201-8_32"},{"key":"9245_CR41","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., & O\u2019Sullivan, B. (2008). Using case-based reasoning in an algorithm portfolio for constraint solving: Irish Conference on Artificial Intelligence and Cognitive Science."},{"key":"9245_CR42","unstructured":"Otten, L., Ihler, A., Kask, K., & Dechter, R. (2012). Winning the PASCAL 2011 MAP challenge with enhanced AND\/OR branch-and-bound. In NIPS DISCML Workshop."},{"key":"9245_CR43","doi-asserted-by":"crossref","unstructured":"Petit, T., R\u00e9gin, J., & Bessi\u00e8re, C. (2000). Meta constraints on violations for over constrained problems. In Proceedings of ICTAI (pp. 358\u2013365).","DOI":"10.1109\/TAI.2000.889894"},{"issue":"4","key":"9245_CR44","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1109\/TPAMI.2014.2353626","volume":"37","author":"D Prusa","year":"2015","unstructured":"Prusa, D., & Werner, T. (2015). Universality of the local marginal polytope. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37(4), 898\u2013904.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9245_CR45","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (Eds.) (2006). Handbook of constraint programming: Elsevier."},{"issue":"1\u20132","key":"9245_CR46","doi-asserted-by":"crossref","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. (2008). Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints, 13 (1\u20132), 130\u2013154.","journal-title":"Constraints"},{"key":"9245_CR47","first-page":"113","volume":"4","author":"M Schlesinger","year":"1976","unstructured":"Schlesinger, M. (1976). Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika, 4, 113\u2013130.","journal-title":"Kibernetika"},{"key":"9245_CR48","unstructured":"Sontag, D., Choe, D., & Li, Y. (2012). Efficiently searching for frustrated cycles in MAP inference. In Proceedings of UAI (pp. 795\u2013804)."},{"key":"9245_CR49","unstructured":"Sontag, D., Meltzer, T., Globerson, A., Weiss, Y., & Jaakkola, T. (2008). Tightening LP relaxations for MAP using message-passing. In Proceedings of UAI (pp. 503\u2013510)."},{"issue":"7","key":"9245_CR50","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T Werner","year":"2007","unstructured":"Werner, T. (2007). A linear programming approach to max-sum problem. Pattern Analysis and Machine Intelligence, 29(7), 1165\u20131179.","journal-title":"Pattern Analysis and Machine Intelligence"},{"key":"9245_CR51","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H.H., & Leyton-Brown, K. (2008). SATzilla: Portfolio-based algorithm selection for SAT. In Journal of artificial intelligence research (pp. 565\u2013606).","DOI":"10.1613\/jair.2490"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9245-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9245-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9245-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T21:13:48Z","timestamp":1748898828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9245-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,22]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9245"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9245-y","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,22]]}}}