{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T17:37:58Z","timestamp":1785173878451,"version":"3.55.0"},"reference-count":76,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Operational Programme Human Resources Development, Education and Lifelong Learning 2014-2020","award":["MIS 5007500"],"award-info":[{"award-number":["MIS 5007500"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality constraints, which are known to be particularly difficult to articulate within the QUBO framework. This is, we believe, the first time this major obstacle is overcome and the TSPTW is cast in the QUBO formulation. We have every reason to anticipate that this development will lead to the actual execution of small scale TSPTW instances on the D-Wave platform.<\/jats:p>","DOI":"10.3390\/a12110224","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T11:05:18Z","timestamp":1572001518000},"page":"224","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":71,"title":["A QUBO Model for the Traveling Salesman Problem with Time Windows"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0467-796X","authenticated-orcid":false,"given":"Christos","family":"Papalitsas","sequence":"first","affiliation":[{"name":"Department of Informatics, Ionian University, Tsirigoti Square 7, 49100 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodore","family":"Andronikos","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, Tsirigoti Square 7, 49100 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4199-6708","authenticated-orcid":false,"given":"Konstantinos","family":"Giannakis","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, Tsirigoti Square 7, 49100 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georgia","family":"Theocharopoulou","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, Tsirigoti Square 7, 49100 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sofia","family":"Fanarioti","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, Tsirigoti Square 7, 49100 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2019,10,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","article-title":"Simulating physics with computers","volume":"21","author":"Feynman","year":"1982","journal-title":"Int. J. Theor. Phys."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Grover, L. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_4","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_5","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M. (2000). Quantum computation by adiabatic evolution. arXiv."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1126\/science.1057726","article-title":"A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem","volume":"292","author":"Farhi","year":"2001","journal-title":"Science"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s11128-008-0082-9","article-title":"Minor-embedding in adiabatic quantum computation: I. The parameter setting problem","volume":"7","author":"Choi","year":"2008","journal-title":"Quantum Inf. Process."},{"key":"ref_8","unstructured":"Messiah, A. (1961). Quantum Mechanics, Dover Publications."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"220401","DOI":"10.1103\/PhysRevLett.102.220401","article-title":"Consistency of the adiabatic theorem","volume":"102","author":"Amin","year":"2009","journal-title":"Phys. Rev. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1137\/080734479","article-title":"Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation","volume":"50","author":"Aharonov","year":"2008","journal-title":"SIAM Rev."},{"key":"ref_11","unstructured":"Kadowaki, T. (2002). Study of optimization problems by quantum annealing. arXiv."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","article-title":"Quantum annealing in the transverse Ising model","volume":"58","author":"Kadowaki","year":"1998","journal-title":"Phys. Rev. E"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1017\/S1471068418000066","article-title":"Performing fully parallel constraint logic programming on a quantum annealer","volume":"18","author":"Pakin","year":"2018","journal-title":"Theory Pract. Logic Programm."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1038\/srep00571","article-title":"Finding low-energy conformations of lattice protein models by quantum annealing","volume":"2","author":"Dickson","year":"2012","journal-title":"Sci. Rep."},{"key":"ref_16","unstructured":"Sarkar, A. (2018). Quantum Algorithms: For Pattern-Matching in Genomic Sequences. [Master\u2019s Thesis, Delft University of Technology]."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1038\/nature23474","article-title":"Quantum machine learning","volume":"549","author":"Biamonte","year":"2017","journal-title":"Nature"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Papalitsas, C., Karakostas, P., Andronikos, T., Sioutas, S., and Giannakis, K. (2018). Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection. Algorithms, 11.","DOI":"10.3390\/a11040038"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"073023","DOI":"10.1088\/1367-2630\/ab2a9e","article-title":"Quantum gradient descent and Newton\u2019s method for constrained polynomial optimization","volume":"21","author":"Rebentrost","year":"2019","journal-title":"New J. Phys."},{"key":"ref_20","unstructured":"D-Wave System (2019, October 24). Getting Started with the D-Wave System; Technical Report for D-Wave Systems. Available online: https:\/\/docs.dwavesys.com\/docs\/latest\/_downloads\/09-1076A-T_GettingStarted.pdf."},{"key":"ref_21","unstructured":"Boothby, K., Bunyk, P., Raymond, J., and Roy, A. (2019, October 24). Next-Generation Topology of D-Wave Quantum Processors; Technical Report for D-Wave Systems. Available online: https:\/\/www.dwavesys.com\/sites\/default\/files\/14-\\1026A-C_Next-Generation-Topology-of-DW-Quantum-Processors.pdf."},{"key":"ref_22","unstructured":"Dattani, N., Szalay, S., and Chancellor, N. (2019). Pegasus: The second connectivity graph for large-scale quantum annealing hardware. arXiv."},{"key":"ref_23","unstructured":"Dattani, N., and Chancellor, N. (2019). Embedding quadratization gadgets on Chimera and Pegasus graphs. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(90)90044-6","article-title":"Upper-bounds for quadratic 0\u20131 maximization","volume":"9","author":"Boros","year":"1990","journal-title":"Oper. Res. Lett."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.21751","article-title":"Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis","volume":"70","author":"Lewis","year":"2017","journal-title":"Networks"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","article-title":"The unconstrained binary quadratic programming problem: A survey","volume":"28","author":"Kochenberger","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_27","unstructured":"Lloyd, S., Mohseni, M., and Rebentrost, P. (2013). Quantum algorithms for supervised and unsupervised machine learning. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Hauke, P., Katzgraber, H.G., Lechner, W., Nishimori, H., and Oliver, W.D. (2019). Perspectives of quantum annealing: Methods and implementations. arXiv.","DOI":"10.1088\/1361-6633\/ab85b8"},{"key":"ref_29","unstructured":"Glover, F., and Kochenberger, G. (2018). A Tutorial on Formulating QUBO Models. arXiv."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10732-007-9009-3","article-title":"Local search heuristics for quadratic unconstrained binary optimization (QUBO)","volume":"13","author":"Boros","year":"2007","journal-title":"J. Heuristics"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Ushijima-Mwesigwa, H., Negre, C.F., and Mniszewski, S.M. (2017, January 12\u201317). Graph partitioning using quantum annealing on the D-Wave system. Proceedings of the Second International Workshop on Post Moores Era Supercomputing, Denver, CO, USA.","DOI":"10.1145\/3149526.3149531"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1103\/RevModPhys.25.353","article-title":"On the theory of the Ising model of ferromagnetism","volume":"25","author":"Newell","year":"1953","journal-title":"Rev. Mod. Phys."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3389\/fphy.2014.00005","article-title":"Ising formulations of many NP problems","volume":"2","author":"Lucas","year":"2014","journal-title":"Front. Phys."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"29","DOI":"10.3389\/fict.2017.00029","article-title":"Traffic flow optimization using a quantum annealer","volume":"4","author":"Neukart","year":"2017","journal-title":"Front. ICT"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"057701","DOI":"10.1103\/PhysRevE.70.057701","article-title":"Quantum annealing of the traveling-salesman problem","volume":"70","author":"Santoro","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1007\/s11128-012-0490-8","article-title":"Adapting the traveling salesman problem to an adiabatic quantum computer","volume":"12","author":"Warren","year":"2013","journal-title":"Quantum Inf. Process."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Warren, R.H. (2017). Small traveling salesman problems. J. Adv. Appl. Math., 2.","DOI":"10.22606\/jaam.2017.22003"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Feld, S., Roch, C., Gabor, T., Seidel, C., Neukart, F., Galter, I., Mauerer, W., and Linnhoff-Popien, C. (2018). A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer. arXiv.","DOI":"10.3389\/fict.2019.00013"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Irie, H., Wongpaisarnsin, G., Terabe, M., Miki, A., and Taguchi, S. (2019). Quantum annealing of vehicle routing problem with time, state and capacity. International Workshop on Quantum Technology and Optimization Problems, Springer.","DOI":"10.1007\/978-3-030-14082-3_13"},{"key":"ref_40","unstructured":"Neven, H., Denchev, V.S., Rose, G., and Macready, W.G. (2009). Training a large scale classifier with the quantum adiabatic algorithm. arXiv."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"230506","DOI":"10.1103\/PhysRevLett.108.230506","article-title":"Adiabatic quantum algorithm for search engine ranking","volume":"108","author":"Garnerone","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Cruz-Santos, W., Venegas-Andraca, S., and Lanzagorta, M. (2018). A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers. Entropy, 20.","DOI":"10.3390\/e20100786"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1080\/00107514.2018.1450720","article-title":"A cross-disciplinary introduction to quantum annealing-based algorithms","volume":"59","author":"McGeoch","year":"2018","journal-title":"Contemp. Phys."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E.G., Venturelli, D., and Biswas, R. (2019). From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms, 12.","DOI":"10.3390\/a12020034"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"6603","DOI":"10.1038\/srep06603","article-title":"Adiabatic quantum simulation of quantum chemistry","volume":"4","author":"Babbush","year":"2014","journal-title":"Sci. Rep."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1840007","DOI":"10.1142\/S0219749918400075","article-title":"QUBO formulation for the contact map overlap problem","volume":"16","author":"Oliveira","year":"2018","journal-title":"Int. J. Quantum Inf."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Crispin, A., and Syrichas, A. (2013, January 13\u201316). Quantum annealing algorithm for vehicle scheduling. Proceedings of the 2013 IEEE International Conference on Systems, Man, and Cybernetics, Manchester, UK.","DOI":"10.1109\/SMC.2013.601"},{"key":"ref_48","first-page":"267","article-title":"Hybrid Quantum Genetic Algorithm and Its Application in VRP","volume":"7","author":"Cai","year":"2010","journal-title":"Comput. Simul."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1103\/RevModPhys.58.801","article-title":"Spin glasses: Experimental facts, theoretical concepts, and open questions","volume":"58","author":"Binder","year":"1986","journal-title":"Rev. Mod. Phys."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Young, A.P. (1998). Spin Glasses and Random Fields, World Scientific.","DOI":"10.1142\/3517"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Nishimori, H. (2001). Statistical Physics of Spin Glasses and Information Processing: An Introduction, Clarendon Press. Number 111.","DOI":"10.1093\/acprof:oso\/9780198509417.001.0001"},{"key":"ref_52","first-page":"031040","article-title":"Quantum optimization of fully connected spin glasses","volume":"5","author":"Venturelli","year":"2015","journal-title":"Phys. Rev. X"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.disopt.2010.12.001","article-title":"Quantum annealing of the graph coloring problem","volume":"8","author":"Titiloye","year":"2011","journal-title":"Discret. Optim."},{"key":"ref_54","unstructured":"Venturelli, D., Marchand, D.J., and Rojo, G. (2015). Quantum annealing implementation of job-shop scheduling. arXiv."},{"key":"ref_55","first-page":"041052","article-title":"Quantum-assisted learning of hardware-embedded probabilistic graphical models","volume":"7","author":"Benedetti","year":"2017","journal-title":"Phys. Rev. X"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"066707","DOI":"10.1103\/PhysRevE.71.066707","article-title":"Optimization by quantum annealing: Lessons from hard satisfiability problems","volume":"71","author":"Battaglia","year":"2005","journal-title":"Phys. Rev. E"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Alom, M.Z., Van Essen, B., Moody, A.T., Widemann, D.P., and Taha, T.M. (2017, January 14\u201319). Quadratic Unconstrained Binary Optimization (QUBO) on neuromorphic computing system. Proceedings of the 2017 International Joint Conference on Neural Networks (IJCNN), Anchorage, AK, USA.","DOI":"10.1109\/IJCNN.2017.7966350"},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Bar\u00e1n, B., and Villagra, M. (2019). A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization. Axioms, 8.","DOI":"10.3390\/axioms8010032"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"4529","DOI":"10.1016\/S0362-546X(96)00367-7","article-title":"A new hybrid genetic algorithm for global optimization","volume":"30","author":"Sotiropoulos","year":"1997","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch and bound algorithm for quadratic zero-one programming","volume":"45","author":"Pardalos","year":"1990","journal-title":"Computing"},{"key":"ref_61","unstructured":"Farhi, E., Goldstone, J., and Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv."},{"key":"ref_62","unstructured":"Pagano, G., Bapat, A., Becker, P., Collins, K., De, A., Hess, P., Kaplan, H., Kyprianidis, A., Tan, W., and Baldwin, C. (2019). Quantum Approximate Optimization with a Trapped-Ion Quantum Simulator. arXiv."},{"key":"ref_63","unstructured":"Farhi, E., and Harrow, A.W. (2016). Quantum supremacy through the quantum approximate optimization algorithm. arXiv."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Vyskocil, T., and Djidjev, H. (2019). Embedding Equality Constraints of Optimization Problems into a Quantum Annealer. Algorithms, 12.","DOI":"10.3390\/a12040077"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Mahasinghe, A., Hua, R., Dinneen, M.J., and Goyal, R. (2019, January 29\u201331). Solving the Hamiltonian Cycle Problem Using a Quantum Computer. Proceedings of the Australasian Computer Science Week Multiconference, Sydney, NSW, Australia.","DOI":"10.1145\/3290688.3290703"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Lahoz-Beltra, R. (2016). Quantum genetic algorithms for computer scientists. Computers, 5.","DOI":"10.3390\/computers5040024"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1007\/s10589-016-9844-y","article-title":"Building an iterative heuristic solver for a quantum annealer","volume":"65","author":"Rosenberg","year":"2016","journal-title":"Comput. Optim. Appl."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/net.3230230706","article-title":"A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows","volume":"23","author":"Langevin","year":"1993","journal-title":"Networks"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","article-title":"An optimal algorithm for the traveling salesman problem with time windows","volume":"43","author":"Dumas","year":"1995","journal-title":"Oper. Res."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","article-title":"A generalized insertion heuristic for the traveling salesman problem with time windows","volume":"46","author":"Gendreau","year":"1998","journal-title":"Oper. Res."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","article-title":"A General VNS heuristic for the traveling salesman problem with time windows","volume":"7","author":"Urrutia","year":"2010","journal-title":"Discret. Optim."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Papalitsas, C., Giannakis, K., Andronikos, T., Theotokis, D., and Sifaleras, A. (2015, January 6\u20138). Initialization methods for the TSP with Time Windows using Variable Neighborhood Search. Proceedings of the 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015), Corfu, Greece.","DOI":"10.1109\/IISA.2015.7388106"},{"key":"ref_73","unstructured":"Vlamos, P. (2017). A Quantum Inspired GVNS: Some Preliminary Results. GeNeDis 2016, Springer International Publishing."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Papalitsas, C., and Andronikos, T. (2019). Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows. Technologies, 7.","DOI":"10.3390\/technologies7030061"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/ijoc.1050.0145","article-title":"A compressed-annealing heuristic for the traveling salesman problem with time windows","volume":"19","author":"Ohlmann","year":"2007","journal-title":"INFORMS J. Comput."},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"Feld, S., and Linnhoff-Popien, C. (2019). Embedding Inequality Constraints for Quantum Annealing Optimization. Quantum Technology and Optimization Problems, Springer International Publishing.","DOI":"10.1007\/978-3-030-14082-3"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/224\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:29:26Z","timestamp":1760189366000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,25]]},"references-count":76,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2019,11]]}},"alternative-id":["a12110224"],"URL":"https:\/\/doi.org\/10.3390\/a12110224","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201909.0154.v1","asserted-by":"object"}]},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,25]]}}}