{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:52:43Z","timestamp":1773820363124,"version":"3.50.1"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030499877","type":"print"},{"value":"9783030499884","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-49988-4_28","type":"book-chapter","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:02:53Z","timestamp":1593385373000},"page":"406-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Stable Alternative to Sinkhorn\u2019s Algorithm for Regularized Optimal Transport"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1201-2343","authenticated-orcid":false,"given":"Pavel","family":"Dvurechensky","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7266-3917","authenticated-orcid":false,"given":"Sergey","family":"Omelchenko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4963-8227","authenticated-orcid":false,"given":"Alexander","family":"Tiurin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"28_CR1","unstructured":"Allen-Zhu, Z., Li, Y., Oliveira, R., Wigderson, A.: Much faster algorithms for matrix scaling. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 890\u2013901 (2017). \narXiv:1704.02315"},{"key":"28_CR2","unstructured":"Altschuler, J., Weed, J., Rigollet, P.: Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems 30, pp. 1961\u20131971. Curran Associates, Inc. (2017). \narXiv:1705.09634"},{"issue":"8","key":"28_CR3","doi-asserted-by":"crossref","first-page":"1262","DOI":"10.1134\/S0965542517080048","volume":"57","author":"AS Anikin","year":"2017","unstructured":"Anikin, A.S., Gasnikov, A.V., Dvurechensky, P.E., Tyurin, A.I., Chernov, A.V.: Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints. Comput. Math. Math. Phys. 57(8), 1262\u20131276 (2017)","journal-title":"Comput. Math. Math. Phys."},{"key":"28_CR4","unstructured":"Baimurzina, D.R., et al.: Universal method of searching for equilibria and stochastic equilibria in transportation networks. Comput. Math. Math. Phys. 59(1), 19\u201333 (2019). \narXiv:1701.02473"},{"issue":"1","key":"28_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2013.10.007","volume":"42","author":"A Beck","year":"2014","unstructured":"Beck, A., Teboulle, M.: A fast dual proximal gradient algorithm for convex minimization and applications. Oper. Res. Lett. 42(1), 1\u20136 (2014)","journal-title":"Oper. Res. Lett."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Benamou, J.D., Carlier, G., Cuturi, M., Nenna, L., Peyr\u00e9, G.: Iterative Bregman projections for regularized transportation problems. SIAM J. Sci. Comput. 37(2), A1111\u2013A1138 (2015)","DOI":"10.1137\/141000439"},{"issue":"1","key":"28_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"28_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0041-5553(67)90069-9","volume":"7","author":"L Bregman","year":"1967","unstructured":"Bregman, L.: Proof of the convergence of Sheleikhovskii\u2019s method for a problem with transportation constraints. USSR Comput. Math. Math. Phys. 7(1), 191\u2013204 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"28_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-44914-2_31","volume-title":"Discrete Optimization and Operations Research","author":"A Chernov","year":"2016","unstructured":"Chernov, A., Dvurechensky, P., Gasnikov, A.: Fast primal-dual gradient method for strongly convex minimization problems with linear constraints. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 391\u2013403. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44914-2_31"},{"key":"28_CR11","unstructured":"Chizat, L., Peyr\u00e9, G., Schmitzer, B., Vialard, F.X.: Scaling algorithms for unbalanced optimal transport problems. Math. Comput. 87(314), 2563\u20132609 (2018). \narXiv:1607.05816"},{"key":"28_CR12","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 26, pp. 2292\u20132300. Curran Associates, Inc. (2013)"},{"issue":"1","key":"28_CR13","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/15M1032600","volume":"9","author":"M Cuturi","year":"2016","unstructured":"Cuturi, M., Peyr\u00e9, G.: A smoothed dual approach for variational Wasserstein problems. SIAM J. Imaging Sci. 9(1), 320\u2013343 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"28_CR14","unstructured":"D\u00fcnner, C., Forte, S., Tak\u00e1\u010d, M., Jaggi, M.: Primal-dual rates and certificates. In: Proceedings of the 33rd International Conference on International Conference on Machine Learning, ICML 2016, vol. 48. pp. 783\u2013792. JMLR.org (2016)"},{"key":"28_CR15","doi-asserted-by":"publisher","unstructured":"Dvinskikh, D., Gorbunov, E., Gasnikov, A., Dvurechensky, P., Uribe, C.A.: On primal and dual approaches for distributed stochastic convex optimization over networks. In: 2019 IEEE 58th Conference on Decision and Control (CDC), pp. 7435\u20137440 (2019). \nhttps:\/\/doi.org\/10.1109\/CDC40024.2019.9029798\n\n. \narXiv:1903.09844","DOI":"10.1109\/CDC40024.2019.9029798"},{"key":"28_CR16","unstructured":"Dvurechensky, P., Dvinskikh, D., Gasnikov, A., Uribe, C.A., Nedi\u0107, A.: Decentralize and randomize: faster algorithm for Wasserstein barycenters. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31, NeurIPS 2018, pp. 10783\u201310793. Curran Associates, Inc. (2018). \narXiv:1806.03915"},{"key":"28_CR17","unstructured":"Dvurechensky, P., Gasnikov, A., Gasnikova, E., Matsievsky, S., Rodomanov, A., Usik, I.: Primal-dual method for searching equilibrium in hierarchical congestion population games. In: Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016) Vladivostok, Russia, 19\u201323 September 2016, pp. 584\u2013595 (2016). \narXiv:1606.08988"},{"key":"28_CR18","unstructured":"Dvurechensky, P., Gasnikov, A., Kroshnin, A.: Computational optimal transport: complexity by accelerated gradient descent is better than by Sinkhorn\u2019s algorithm. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 1367\u20131376 (2018). \narXiv:1802.04367"},{"issue":"1","key":"28_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10957-015-0771-3","volume":"166","author":"P Dvurechensky","year":"2015","unstructured":"Dvurechensky, P., Nesterov, Y., Spokoiny, V.: Primal-dual methods for solving infinite-dimensional games. J. Optim. Theory Appl. 166(1), 23\u201351 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Fang, S.-C., Rajasekera, J. R., Tsao, H.-S. J.: Entropy Optimization and Mathematical Programming. Kluwer\u2019 International Series. Springer, Boston (1997)","DOI":"10.1007\/978-1-4615-6131-6"},{"key":"28_CR21","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/0024-3795(89)90490-4","volume":"114","author":"J Franklin","year":"1989","unstructured":"Franklin, J., Lorenz, J.: On the scaling of multidimensional matrices. Linear Algebra Appl. 114, 717\u2013735 (1989). Special Issue Dedicated to Alan J. Hoffman","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"28_CR22","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1134\/S0965542516040084","volume":"56","author":"AV Gasnikov","year":"2016","unstructured":"Gasnikov, A.V., Gasnikova, E.V., Nesterov, Y.E., Chernov, A.V.: Efficient numerical methods for entropy-linear programming problems. Comput. Math. Math. Phys. 56(4), 514\u2013524 (2016)","journal-title":"Comput. Math. Math. Phys."},{"issue":"4","key":"28_CR23","first-page":"111","volume":"28","author":"A Gasnikov","year":"2016","unstructured":"Gasnikov, A., Gasnikova, E., Mendel, M., Chepurchenko, K.: Evolutionary derivations of entropy model for traffic demand matrix calculation. Matematicheskoe Modelirovanie 28(4), 111\u2013124 (2016). (in Russian)","journal-title":"Matematicheskoe Modelirovanie"},{"key":"28_CR24","volume-title":"Maximum Entropy Econometrics: Robust Estimation with Limited Data","author":"A Golan","year":"1996","unstructured":"Golan, A., Judge, G., Miller, D.: Maximum Entropy Econometrics: Robust Estimation with Limited Data. Wiley, Chichester (1996)"},{"issue":"3","key":"28_CR25","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1137\/120896219","volume":"7","author":"T Goldstein","year":"2014","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S., Baraniuk, R.: Fast alternating direction optimization methods. SIAM J. Imaging Sci. 7(3), 1588\u20131623 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"28_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1134\/S1064562419020042","volume":"99","author":"SV Guminov","year":"2019","unstructured":"Guminov, S.V., Nesterov, Y.E., Dvurechensky, P.E., Gasnikov, A.V.: Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems. Dokl. Math. 99(2), 125\u2013128 (2019)","journal-title":"Dokl. Math."},{"key":"28_CR27","unstructured":"Guminov, S., Dvurechensky, P., Tupitsa, N., Gasnikov, A.: Accelerated alternating minimization, accelerated Sinkhorn\u2019s algorithm and accelerated Iterative Bregman Projections (2019). \narXiv:1906.03622"},{"key":"28_CR28","series-title":"Springer Series in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer, New York (2001). \nhttps:\/\/doi.org\/10.1007\/978-0-387-21606-5"},{"issue":"5","key":"28_CR29","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1109\/TAC.2014.2298712","volume":"59","author":"D Jakoveti\u0107","year":"2014","unstructured":"Jakoveti\u0107, D., Xavier, J., Moura, J.M.F.: Fast distributed gradient methods. IEEE Trans. Autom. Control 59(5), 1131\u20131146 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"28_CR30","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0167-6377(93)90087-W","volume":"14","author":"B Kalantari","year":"1993","unstructured":"Kalantari, B., Khachiyan, L.: On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Oper. Res. Lett. 14(5), 237\u2013244 (1993)","journal-title":"Oper. Res. Lett."},{"key":"28_CR31","unstructured":"Kantorovich, L.: On the translocation of masses. Doklady Acad. Sci. USSR (N.S.) 37, 199\u2013201 (1942)"},{"key":"28_CR32","volume-title":"Maximum \u2013 Entropy Models in Science and Engineering","author":"J Kapur","year":"1989","unstructured":"Kapur, J.: Maximum \u2013 Entropy Models in Science and Engineering. Wiley, New York (1989)"},{"key":"28_CR33","unstructured":"Kroshnin, A., Tupitsa, N., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., Uribe, C.: On the complexity of approximating Wasserstein barycenters. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, Long Beach, California, USA, 09\u201315 June 2019, vol. 97, pp. 3530\u20133540. PMLR (2019). \narXiv:1901.08686"},{"issue":"1","key":"28_CR34","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10957-015-0757-1","volume":"168","author":"J Li","year":"2016","unstructured":"Li, J., Wu, Z., Wu, C., Long, Q., Wang, X.: An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints. J. Optim. Theory Appl. 168(1), 153\u2013171 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"28_CR35","unstructured":"Lin, T., Ho, N., Jordan, M.: On efficient optimal transport: an analysis of greedy and accelerated mirror descent algorithms. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, Long Beach, California, USA, 09\u201315 June 2019, vol. 97, pp. 3982\u20133991. PMLR (2019)"},{"issue":"1","key":"28_CR36","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/16M1092015","volume":"28","author":"Y Malitsky","year":"2018","unstructured":"Malitsky, Y., Pock, T.: A first-order primal-dual algorithm with linesearch. SIAM J. Optim. 28(1), 411\u2013432 (2018)","journal-title":"SIAM J. Optim."},{"key":"28_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Boston (2004)"},{"issue":"1","key":"28_CR38","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"28_CR39","doi-asserted-by":"publisher","unstructured":"Nesterov, Y., Gasnikov, A., Guminov, S., Dvurechensky, P.: Primal-dual accelerated gradient methods with small-dimensional relaxation oracle. Optim. Methods Softw., 1\u201328 (2020). \nhttps:\/\/doi.org\/10.1080\/10556788.2020.1731747\n\n. \narXiv:1809.05895","DOI":"10.1080\/10556788.2020.1731747"},{"key":"28_CR40","unstructured":"Ogaltsov, A., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., Spokoiny, V.: Adaptive gradient descent for convex and non-convex stochastic optimization (2019). \narXiv:1911.08380"},{"issue":"1","key":"28_CR41","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Eduardo Pasiliao, J.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"28_CR42","doi-asserted-by":"crossref","unstructured":"Patrascu, A., Necoara, I., Findeisen, R.: Rate of convergence analysis of a dual fast gradient method for general convex optimization. In: 2015 54th IEEE Conference on Decision and Control (CDC), pp. 3311\u20133316 (2015)","DOI":"10.1109\/CDC.2015.7402717"},{"key":"28_CR43","unstructured":"Scaman, K., Bach, F., Bubeck, S., Lee, Y.T., Massouli\u00e9, L.: Optimal algorithms for smooth and strongly convex distributed optimization in networks. In: Precup, A., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 70, International Convention Centre, Sydney, Australia, 06\u201311 August 2017, pp. 3027\u20133036. PMLR (2017)"},{"key":"28_CR44","unstructured":"Schmitzer, B.: Stabilized sparse scaling algorithms for entropy regularized transport problems. SIAM J. Sci. Comput. 41(3), A1443\u2013A1481 (2019). \narXiv:1610.06519"},{"issue":"11","key":"28_CR45","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1023\/A:1027348026919","volume":"64","author":"VI Shvetsov","year":"2003","unstructured":"Shvetsov, V.I.: Mathematical modeling of traffic flows. Autom. Remote Control 64(11), 1651\u20131689 (2003)","journal-title":"Autom. Remote Control"},{"key":"28_CR46","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1090\/S0002-9939-1974-0357434-8","volume":"45","author":"R Sinkhorn","year":"1974","unstructured":"Sinkhorn, R.: Diagonal equivalence to matrices with prescribed row and column sums. II. Proc. Am. Math. Soc. 45, 195\u2013198 (1974)","journal-title":"Proc. Am. Math. Soc."},{"key":"28_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-22629-9_8","volume-title":"Mathematical Optimization Theory and Operations Research","author":"FS Stonyakin","year":"2019","unstructured":"Stonyakin, F.S., et al.: Gradient methods for problems with inexact model of the objective. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) MOTOR 2019. LNCS, vol. 11548, pp. 97\u2013114. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-22629-9_8\n\n. \narXiv:1902.09001"},{"key":"28_CR48","unstructured":"Tran-Dinh, Q., Cevher, V.: Constrained convex minimization via model-based excessive gap. In: Proceedings of the 27th International Conference on Neural Information Processing Systems, NIPS 2014, pp. 721\u2013729. MIT Press, Cambridge (2014)"},{"key":"28_CR49","unstructured":"Tran-Dinh, Q., Fercoq, O., Cevher, V.: A smooth primal-dual optimization framework for nonsmooth composite convex minimization. SIAM J. Optim. 28(1), 96\u2013134 (2018). \narXiv:1507.06243"},{"key":"28_CR50","unstructured":"Tupitsa, N., Dvurechensky, P., Gasnikov, A., Uribe, C.A.: Multimarginal optimal transport by accelerated gradient descent (2020). \narXiv:2004.02294"},{"key":"28_CR51","unstructured":"Uribe, C.A., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., Nedi\u0107, A.: Distributed computation of Wasserstein barycenters over networks. In: 2018 IEEE Conference on Decision and Control (CDC), pp. 6544\u20136549 (2018). \narXiv:1803.02933"},{"key":"28_CR52","series-title":"Monographs in Spatial and Environmental Systems Analysis","volume-title":"Entropy in Urban and Regional Modelling","author":"A Wilson","year":"2011","unstructured":"Wilson, A.: Entropy in Urban and Regional Modelling. Monographs in Spatial and Environmental Systems Analysis. Routledge, Abingdon (2011)"},{"key":"28_CR53","unstructured":"Yurtsever, A., Tran-Dinh, Q., Cevher, V.: A universal primal-dual convex optimization framework. In: Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS 2015, pp. 3150\u20133158. MIT Press, Cambridge (2015)"},{"issue":"5","key":"28_CR54","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1109\/TNET.2005.857115","volume":"13","author":"Y Zhang","year":"2005","unstructured":"Zhang, Y., Roughan, M., Lund, C., Donoho, D.L.: Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach. IEEE\/ACM Trans. Netw. 13(5), 947\u2013960 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"28_CR55","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. Roy. Stat. Soc. B 67(2), 301\u2013320 (2005)","journal-title":"J. Roy. Stat. Soc. B"}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49988-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:06:03Z","timestamp":1593385563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49988-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030499877","9783030499884"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49988-4_28","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":"29 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.nsc.ru\/conference\/motor\/2020\/","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":"102","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":"31","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":"30% - 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,5","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":"2,5","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)"}}]}}