{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:39:35Z","timestamp":1742920775717,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_11","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"177-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Bounding Linear Programs by Constraint Propagation: Application to Max-SAT"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1944-6569","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Dlask","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6161-7157","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"11_CR1","unstructured":"Bacchus, F., J\u00e4rvisalo, M., Martins, R.: MaxSAT Evaluation 2018: new developments and detailed results. J. Satisfiability Boolean Model. Comput. 11(1), 99\u2013131 (2019). Instances https:\/\/maxsat-evaluations.github.io\/"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Handbook of Constraint Programming, chap. 16. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80020-9"},{"issue":"7\u20138","key":"11_CR3","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., 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":"11_CR4","doi-asserted-by":"publisher","unstructured":"Dlask, T., Werner, T.: On relation between constraint propagation and block-coordinate descent in linear programs. In: Simonis, H. (ed.) International Conference on Principles and Practice of Constraint Programming. LNCS, vol. 12333, pp. 194\u2013210. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_12","DOI":"10.1007\/978-3-030-58475-7_12"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-free search. J. ACM (JACM) 29(1), 24\u201332 (1982)","journal-title":"J. ACM (JACM)"},{"key":"11_CR6","unstructured":"Globerson, A., Jaakkola, T.S.: Fixing max-product: convergent message passing algorithms for MAP LP-relaxations. In: Advances in Neural Information Processing Systems, pp. 553\u2013560 (2008)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley Series in Discrete Mathematics and Optimization, Wiley (2000)","DOI":"10.1002\/9781118033036"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11263-015-0809-x","volume":"115","author":"JH Kappes","year":"2015","unstructured":"Kappes, J.H., et al.: A comparative study of modern inference techniques for structured discrete energy minimization problems. Intl. J. Comput. Vis. 115(2), 155\u2013184 (2015)","journal-title":"Intl. J. Comput. Vis."},{"key":"11_CR9","unstructured":"Khanna, S., Sudan, M.: The optimization complexity of constraint satisfaction problems. In: Electronic Colloquium on Computational Complexity. Citeseer (1996)"},{"issue":"10","key":"11_CR10","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."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1007\/978-3-540-88690-7_60","volume-title":"Computer Vision \u2013 ECCV 2008","author":"N Komodakis","year":"2008","unstructured":"Komodakis, N., Paragios, N.: Beyond loose LP-relaxations: optimizing MRFs by repairing cycles. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5304, pp. 806\u2013820. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88690-7_60"},{"key":"11_CR12","first-page":"149","volume":"8","author":"VK Koval","year":"1976","unstructured":"Koval, V.K., Schlesinger, M.I.: Dvumernoe programmirovanie v zadachakh analiza izobrazheniy (Two-dimensional programming in image analysis problems). Autom. Telemech. 8, 149\u2013168 (1976). in Russian","journal-title":"Autom. Telemech."},{"key":"11_CR13","unstructured":"Kovalevsky, V., Koval, V.: A diffusion algorithm for decreasing energy of max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR (1975, unpublished)"},{"key":"11_CR14","series-title":"Universitext","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30717-4","volume-title":"Understanding and Using Linear Programming","author":"J Matou\u0161ek","year":"2006","unstructured":"Matou\u0161ek, J., G\u00e4rtner, B.: Understanding and Using Linear Programming. Universitext. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-30717-4"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen, H., de Givry, S., Schiex, T., Bessiere, C.: Maintaining virtual arc consistency dynamically during search. In: International Conference on Tools with Artificial Intelligence (ICTAI), pp. 8\u201315. IEEE Computer Society (2014)","DOI":"10.1109\/ICTAI.2014.13"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen, H., Schiex, T., Bessiere, C.: Dynamic virtual arc consistency. In: The 28th Annual ACM Symposium on Applied Computing, pp. 98\u2013103 (2013)","DOI":"10.1145\/2480362.2480384"},{"key":"11_CR17","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Corporation (1998)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01581088","volume":"57","author":"PM Pardalos","year":"1992","unstructured":"Pardalos, P.M., Vavasis, S.A.: Open questions in complexity theory for numerical optimization. Math. Program. 57, 337\u2013339 (1992)","journal-title":"Math. Program."},{"issue":"3\u20134","key":"11_CR19","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1561\/0600000084","volume":"11","author":"B Savchynskyy","year":"2019","unstructured":"Savchynskyy, B.: Discrete graphical models - an optimization perspective. Found. Trends Comput. Graph. Vis. 11(3\u20134), 160\u2013429 (2019)","journal-title":"Found. Trends Comput. Graph. Vis."},{"issue":"113\u2013130","key":"11_CR20","first-page":"2","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), 2 (1976)","journal-title":"Kibernetika"},{"key":"11_CR21","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1986)"},{"key":"11_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"key":"11_CR23","series-title":"Cognitive Technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33974-5","volume-title":"The Complexity of Valued Constraint Satisfaction Problems","author":"S \u017divn\u00fd","year":"2012","unstructured":"\u017divn\u00fd, S.: The Complexity of Valued Constraint Satisfaction Problems. Cognitive Technologies. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33974-5"},{"issue":"1\u20132","key":"11_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000001","volume":"1","author":"MJ Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I.: Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn. 1(1\u20132), 1\u2013305 (2008)","journal-title":"Found. Trends Mach. Learn."},{"issue":"7","key":"11_CR25","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 Anal. Mach. Intell. 29(7), 1165\u20131179 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"11_CR26","unstructured":"Werner, T.: On coordinate minimization of piecewise-affine functions. Technical report. CTU-CMP-2017-05, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague (2017)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T14:41:02Z","timestamp":1619188862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"122","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":"55","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":"45% - 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.13","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":"3.47","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}