{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:46:02Z","timestamp":1743014762123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"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_12","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"194-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs"],"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":[{"doi-asserted-by":"crossref","unstructured":"Bessiere, C.: Constraint propagation. In: Handbook of Constraint Programming, chap. 3. Elsevier (2006)","key":"12_CR1","DOI":"10.1016\/S1574-6526(06)80007-6"},{"issue":"7\u20138","key":"12_CR2","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."},{"unstructured":"Dlask, T.: Minimizing convex piecewise-affine functions by local consistency techniques. Master\u2019s thesis (2018)","key":"12_CR3"},{"doi-asserted-by":"crossref","unstructured":"Dlask, T.: Unit propagation by means of coordinate-wise minimization. In: International Conference on Machine Learning, Optimization, and Data Science. Springer, Heidelberg (2020)","key":"12_CR4","DOI":"10.1007\/978-3-030-64583-0_60"},{"doi-asserted-by":"publisher","unstructured":"Dlask, T., Werner, T.: Bounding linear programs by constraint propagation: application to Max-SAT. In: Simonis, H. (ed.) International Conference on Principles and Practice of Constraint Programming. LNCS, vol. 12333, pp. 177\u2013193. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_11","key":"12_CR5","DOI":"10.1007\/978-3-030-58475-7_11"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-030-53552-0_8","volume-title":"Learning and Intelligent Optimization","author":"T Dlask","year":"2020","unstructured":"Dlask, T., Werner, T.: A class of linear programs solvable by coordinate-wise minimization. In: Kotsireas, I.S., Pardalos, P.M. (eds.) LION 2020. LNCS, vol. 12096, pp. 52\u201367. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53552-0_8"},{"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":"12_CR7"},{"issue":"2","key":"12_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., Kappes, J.H., et al.: A comparative study of modern inference techniques for structured discrete energy minimization problems. Int. J. Comput. Vis. 115(2), 155\u2013184 (2015)","journal-title":"Int. J. Comput. Vis."},{"issue":"10","key":"12_CR9","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":"12_CR10","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. Telemec. 8, 149\u2013168 (1976). (in Russian)","journal-title":"Autom. Telemec."},{"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":"12_CR11"},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"C Lemar\u00e9chal","year":"2004","unstructured":"Lemar\u00e9chal, C., Hiriart-Urruty, J.: Fundamentals of Convex Analysis. Springer, New York (2004). https:\/\/doi.org\/10.1007\/978-3-642-56468-0"},{"key":"12_CR13","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"},{"unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Corporation (1998)","key":"12_CR14"},{"issue":"3\u20134","key":"12_CR15","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":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"12_CR17","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":"12_CR18","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":"12_CR19","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."},{"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)","key":"12_CR20"},{"doi-asserted-by":"crossref","unstructured":"Werner, T., Pr\u016f\u0161a, D., Dlask, T.: Relative interior rule in block-coordinate descent. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 7559\u20137567 (2020)","key":"12_CR21","DOI":"10.1109\/CVPR42600.2020.00758"},{"doi-asserted-by":"crossref","unstructured":"Werner, T., Pr\u016f\u0161a, D.: Relative interior rule in block-coordinate minimization. arXiv.org (2019)","key":"12_CR22","DOI":"10.1109\/CVPR42600.2020.00758"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-1-4613-3629-7_19","volume-title":"Advances in Optimization and Approximation","author":"S Zhang","year":"1994","unstructured":"Zhang, S.: On the strictly complementary slackness relation in linear programming. In: Du, D.Z., Sun, J. (eds.) Advances in Optimization and Approximation, vol. 1, pp. 347\u2013361. Springer, Boston (1994). https:\/\/doi.org\/10.1007\/978-1-4613-3629-7_19"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:31:26Z","timestamp":1619242286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_12","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)"}}]}}