{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:13:04Z","timestamp":1768338784111,"version":"3.49.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030589417","type":"print"},{"value":"9783030589424","type":"electronic"}],"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-58942-4_16","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"239-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Primal Heuristics for Wasserstein Barycenters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6560-8453","authenticated-orcid":false,"given":"Pierre-Yves","family":"Bouchet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-3528","authenticated-orcid":false,"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"2","key":"16_CR1","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":"16_CR2","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, Algorithms, and Applications. Cambridge, Mass.: Alfred P. Sloan School of Management, Massachusetts Institute of Technology (1988)","DOI":"10.21236\/ADA594171"},{"issue":"2","key":"16_CR3","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":"16_CR4","unstructured":"Arjovsky, M., Chintala, S., Bottou, L.: Wasserstein GAN. arXiv preprint arXiv:1701.07875 (2017)"},{"key":"16_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, pp. 5793\u20135803 (2018)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-19212-9_23","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"G Auricchio","year":"2019","unstructured":"Auricchio, G., Bassetti, F., Gualandi, S., Veneroni, M.: Computing Wasserstein Barycenters via linear programming. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 355\u2013363. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_23"},{"key":"16_CR7","unstructured":"Bassetti, F., Gualandi, S., Veneroni, M.: On the computation of Kantorovich-Wasserstein distances between 2D-histograms by uncapacitated minimum cost flows. arXiv preprint arXiv:1804.00445 (2018)"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3306346.3323021","volume":"38","author":"N Bonneel","year":"2019","unstructured":"Bonneel, N., Coeurjolly, D.: Spot: sliced partial optimal transport. ACM Trans. Graph. 38(4), 1\u201313 (2019)","journal-title":"ACM Trans. Graph."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/2070781.2024192","volume":"30","author":"N Bonneel","year":"2011","unstructured":"Bonneel, N., Van De Panne, M., Paris, S., Heidrich, W.: Displacement interpolation using Lagrangian mass transport. ACM Trans. Graph. 30, 158\u2013160 (2011)","journal-title":"ACM Trans. Graph."},{"key":"16_CR10","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in Neural Information Processing Systems, pp. 2292\u20132300 (2013)"},{"key":"16_CR11","unstructured":"Cuturi, M., Doucet, A.: Fast computation of Wasserstein Barycenters. In: International Conference on Machine Learning, pp. 685\u2013693 (2014)"},{"key":"16_CR12","unstructured":"Dvurechenskii, P., Dvinskikh, D., Gasnikov, A., Uribe, C., Nedich, A.: Decentralize and randomize: faster algorithm for Wasserstein Barycenters. In: Advances in Neural Information Processing Systems, pp. 10760\u201310770 (2018)"},{"key":"16_CR13","unstructured":"Flamary, R., Courty, N.: POT: Python Optimal Transport library (2017). https:\/\/github.com\/rflamary\/POT"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Tardos, \u00c9., Tarjan, R.: Network flow algorithms. Cornell University Operations Research and Industrial Engineering, Technical report (1989)","DOI":"10.21236\/ADA214689"},{"key":"16_CR15","first-page":"136","volume":"17","author":"TC Koopmans","year":"1949","unstructured":"Koopmans, T.C.: Optimum utilization of the transportation system. Econom. J. Econom. Soc. 17, 136\u2013146 (1949)","journal-title":"Econom. J. Econom. Soc."},{"key":"16_CR16","unstructured":"Kusner, M., Sun, Y., Kolkin, N., Weinberger, K.: From word embeddings to document distances. In: International Conference on Machine Learning, pp. 957\u2013966 (2015)"},{"key":"16_CR17","unstructured":"LeCun, Y., Cortes, C., Burges, C.J.: MNIST dataset. http:\/\/yann.lecun.com\/exdb\/mnist\/ . Accessed 12 Mar 2019"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Levina, E., Bickel, P.: The Earth mover\u2019s distance is the mallows distance: some insights from statistics. In: IEEE International Conference on Computer Vision, vol. 2, pp. 251\u2013256 (2001)","DOI":"10.1109\/ICCV.2001.937632"},{"issue":"5","key":"16_CR19","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/TPAMI.2007.1058","volume":"29","author":"H Ling","year":"2007","unstructured":"Ling, H., Okada, K.: An efficient earth mover\u2019s distance algorithm for robust histogram comparison. IEEE Trans. Pattern Anal. Mach. Intell. 29(5), 840\u2013853 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR20","unstructured":"Luise, G., Salzo, S., Pontil, M., Ciliberto, C.: Sinkhorn Barycenters with free support via Frank-Wolfe algorithm. arXiv preprint arXiv:1905.13194 (2019)"},{"key":"16_CR21","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris (1781)"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1146\/annurev-statistics-030718-104938","volume":"6","author":"VM Panaretos","year":"2019","unstructured":"Panaretos, V.M., Zemel, Y.: Statistical aspects of Wasserstein distances. Ann. Rev. Stat. Appl. 6, 405\u2013431 (2019)","journal-title":"Ann. Rev. Stat. Appl."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Pele, O., Werman, M.: Fast and robust earth mover\u2019s distances. In: IEEE International Conference on Computer vision, pp. 460\u2013467 (2009)","DOI":"10.1109\/ICCV.2009.5459199"},{"issue":"5\u20136","key":"16_CR24","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., Cuturi, M., et al.: Computational optimal transport. Found. Trends Mach. Learn. 11(5\u20136), 355\u2013607 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"16_CR25","unstructured":"Qian, Y., Pan, S.: A proximal ALM method for computing Wasserstein Barycenter in d2-clustering of discrete distributions. arXiv preprint arXiv:1809.05990 (2018)"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Rabin, J., Ferradans, S., Papadakis, N.: Adaptive color transfer with relaxed optimal transport. In: 2014 IEEE International Conference on Image Processing, pp. 4852\u20134856 (2014)","DOI":"10.1109\/ICIP.2014.7025983"},{"issue":"2","key":"16_CR27","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vision 40(2), 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vision"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Santambrogio, F.: Optimal Transport for Applied Mathematicians, pp. 99\u2013102. Birk\u00e4user (2015)","DOI":"10.1007\/978-3-319-20828-2"},{"issue":"4","key":"16_CR29","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. 34(4), 66 (2015)","journal-title":"ACM Trans. Graph."},{"key":"16_CR30","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":"16_CR31","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":"16_CR32","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)"},{"key":"16_CR33","unstructured":"Xiao, H., Rasul, K., Vollgraf, R.: Fashion-MNIST: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747 (2017)"}],"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-58942-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T02:42:00Z","timestamp":1723603320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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 (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":"72","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":"25","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":"7","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":"35% - 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.08","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.08","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)"}}]}}