{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T20:58:54Z","timestamp":1779915534585,"version":"3.53.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030192112","type":"print"},{"value":"9783030192129","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_23","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"355-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Computing Wasserstein Barycenters via Linear Programming"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Auricchio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Federico","family":"Bassetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Veneroni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"23_CR1","unstructured":"MNIST dataset. \n                    http:\/\/yann.lecun.com\/exdb\/mnist\/\n                    \n                  . Accessed 29 Nov 2018"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/100805741","volume":"43","author":"M Agueh","year":"2011","unstructured":"Agueh, M., Carlier, G.: Barycenters in the Wasserstein space. SIAM J. Math. Anal. 43(2), 904\u2013924 (2011)","journal-title":"SIAM J. Math. Anal."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Alfred P. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts (1988)","DOI":"10.21236\/ADA594171"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00186-016-0549-x","volume":"84","author":"E Anderes","year":"2016","unstructured":"Anderes, E., Borgwardt, S., Miller, J.: Discrete Wasserstein Barycenters: optimal transport for discrete data. Math. Methods Oper. Res. 84(2), 389\u2013409 (2016)","journal-title":"Math. Methods Oper. Res."},{"key":"23_CR5","unstructured":"Auricchio, G., Bassetti, F., Gualandi, S., Veneroni, M.: Computing Kantorovich-Wasserstein distances on d-dimensional histograms using (d+1)-partite graphs. In: Advances in Neural Information Processing Systems (2018)"},{"key":"23_CR6","unstructured":"Bassetti, F., Gualandi, S., Veneroni, M.: On the computation of Kantorovich-Wasserstein distances between 2D-histograms by uncapacitated minimum cost flows (2018). arXiv preprint: \n                    arXiv:1804.00445"},{"key":"23_CR7","unstructured":"Claici, S., Chien, E., Solomon, J.: Stochastic Wasserstein Barycenters (2018). arXiv preprint: \n                    arXiv:1802.05757"},{"key":"23_CR8","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in Neural Information Processing Systems, pp. 2292\u20132300 (2013)"},{"key":"23_CR9","unstructured":"Cuturi, M., Doucet, A.: Fast computation of Wasserstein Barycenters. In: International Conference on Machine Learning, pp. 685\u2013693 (2014)"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"369","DOI":"10.2140\/pjm.1953.3.369","volume":"3","author":"MM Flood","year":"1953","unstructured":"Flood, M.M.: On the Hitchcock distribution problem. Pac. J. Math. 3(2), 369\u2013386 (1953)","journal-title":"Pac. J. Math."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-20828-2","volume-title":"Optimal Transport for Applied Mathematicians","author":"F Santambrogio","year":"2015","unstructured":"Santambrogio, F.: Optimal Transport for Applied Mathematicians, pp. 99\u2013102. Birk\u00e4user, New York (2015)"},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s101070100259","volume":"91","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A.: On the history of the transportation and maximum flow problems. Math. Program. 91(3), 437\u2013445 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.2140\/pjm.1967.21.343","volume":"21","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn, R., Knopp, P.: Concerning nonnegative matrices and doubly stochastic matrices. Pac. J. Math. 21(2), 343\u2013348 (1967)","journal-title":"Pac. J. Math."},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/2766963","volume":"34","author":"J Solomon","year":"2015","unstructured":"Solomon, J., et al.: Convolutional Wasserstein distances: efficient optimal transportation on geometric domains. ACM Trans. Graph. (TOG) 34(4), 66 (2015)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"23_CR15","unstructured":"Staib, M., Claici, S., Solomon, J.M., Jegelka, S.: Parallel streaming Wasserstein Barycenters. In: Advances in Neural Information Processing Systems, pp. 2647\u20132658 (2017)"},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00283-013-9380-x","volume":"35","author":"AM Vershik","year":"2013","unstructured":"Vershik, A.M.: Long history of the Monge-Kantorovich transportation problem. Math. Intell. 35(4), 1\u20139 (2013)","journal-title":"Math. Intell."},{"key":"23_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2008","unstructured":"Villani, C.: Optimal Transport: Old and New, vol. 338. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-71050-9"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:10:48Z","timestamp":1558984248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","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":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"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"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}