{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:13:43Z","timestamp":1781345623293,"version":"3.54.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00493-022-4884-7","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T11:51:55Z","timestamp":1665402715000},"page":"971-996","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization \u2014 II"],"prefix":"10.1007","volume":"42","author":[{"given":"Amitabh","family":"Basu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Conforti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Di Summa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongyi","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"4884_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1287\/ijoc.12.3.192.12635","volume":"12","author":"K Aardal","year":"2000","unstructured":"K. Aardal, R. E. Bixby, C. A. J. Hurkens, A. K. Lenstra and J. W. Smeltink: Market split and basis reduction: Towards a solution of the cornu\u00e9jols-dawande instances, INFORMS Journal on Computing 12 (2000), 192\u2013202.","journal-title":"INFORMS Journal on Computing"},{"key":"4884_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora and B. Barak: Computational complexity: a modern approach, Cambridge University Press, 2009.","DOI":"10.1017\/CBO9780511804090"},{"key":"4884_CR3","doi-asserted-by":"crossref","unstructured":"A. Basu: Complexity of optimizing over the integers, arXiv: 2110.06172, 2021.","DOI":"10.1007\/s10107-022-01862-z"},{"key":"4884_CR4","unstructured":"A. Basu, M. Conforti, M. Di Summa and H. Jiang: Complexity of cutting plane and branch-and-bound algorithms for mixed-integer optimization, arXiv: 2003.05023, 2019."},{"key":"4884_CR5","first-page":"1","volume-title":"9th Innovations in Theoretical Computer Science Conference (ITCS 2018), volume 94 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"P Beame","year":"2018","unstructured":"P. Beame, N. Fleming, R. Impagliazzo, A. Kolokolova, D. Pankratov, T. Pitassi and R. Robere: Stabbing Planes, in: Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), volume 94 of Leibniz International Proceedings in Informatics (LIPIcs) 10, 1\u201320, Dagstuhl, Germany, 2018, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"4884_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R E Bixby","year":"2002","unstructured":"R. E. Bixby: Solving real-world linear programs: A decade and more of progress, Operations research 50 (2002), 3\u201315.","journal-title":"Operations research"},{"key":"4884_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0166-218X(99)00156-0","volume":"98","author":"A Bockmayr","year":"1999","unstructured":"A. Bockmayr, F. Eisenbrand, M. Hartmann and A. S. Schulz: On the Chv\u00e1tal rank of polytopes in the 0\/1 cube, Discrete Applied Mathematics 98 (1999), 21\u201327.","journal-title":"Discrete Applied Mathematics"},{"key":"4884_CR8","doi-asserted-by":"publisher","first-page":"708","DOI":"10.2307\/2275569","volume":"62","author":"M Bonet","year":"1997","unstructured":"M. Bonet, T. Pitassi and R. Raz: Lower bounds for cutting planes proofs with small coefficients, The Journal of Symbolic Logic 62 (1997), 708\u2013728.","journal-title":"The Journal of Symbolic Logic"},{"key":"4884_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01845704","volume":"35","author":"S R Buss","year":"1996","unstructured":"S. R. Buss and P. Clote: Cutting planes, connectivity, and threshold logic, Archive for Mathematical Logic 35 (1996), 33\u201362.","journal-title":"Archive for Mathematical Logic"},{"key":"4884_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.5556\/j.tkjm.36.2005.101","volume":"36","author":"Ch-P Chen","year":"2005","unstructured":"Ch.-P. Chen and F. Qi: Completely monotonic function associated with the gamma functions and proof of Wallis\u2019 inequality, Tamkang Journal of Mathematics 36 (2005), 303\u2013307.","journal-title":"Tamkang Journal of Mathematics"},{"key":"4884_CR11","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","volume":"28","author":"V Chv\u00e1tal","year":"1980","unstructured":"V. Chv\u00e1tal: Hard knapsack problems, Operations Research 28 (1980), 1402\u20131411.","journal-title":"Operations Research"},{"key":"4884_CR12","volume-title":"Cutting-plane proofs and the stability number of a graph, Report Number 84326-OR","author":"V Chv\u00e1tal","year":"1984","unstructured":"V. Chv\u00e1tal: Cutting-plane proofs and the stability number of a graph, Report Number 84326-OR, Institut fur \u00d6konometrie und Operations Research, Universit\u00e4t Bonn, Bonn, 1984."},{"key":"4884_CR13","first-page":"544","volume":"114","author":"V Chv\u00e1tal","year":"1989","unstructured":"V. Chv\u00e1tal, W. J. Cook and M. Hartmann: On cutting-plane proofs in combinatorial optimization, Linear algebra and its applications 114 (1989), 544\u2013548.","journal-title":"Linear algebra and its applications"},{"key":"4884_CR14","doi-asserted-by":"crossref","unstructured":"P. Clote: Cutting planes and constant depth frege proofs, in: Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, 296\u2013307, 1992.","DOI":"10.1109\/LICS.1992.185542"},{"key":"4884_CR15","doi-asserted-by":"crossref","unstructured":"M. Conforti, G. Cornu\u00e9jols and G. Zambelli: Integer programming, volume 271, Springer, 2014.","DOI":"10.1007\/978-3-319-11008-0"},{"key":"4884_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/140959882","volume":"29","author":"M Conforti","year":"2015","unstructured":"M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza and R. Grappe: Reverse Chv\u00e1tal-Gomory rank, SIAM Journal on Discrete Mathematics 29 (2015), 166\u2013181.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4884_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W J Cook","year":"1987","unstructured":"W. J. Cook, C. R. Coullard and Gy. Tur\u00e1n: On the complexity of cutting-plane proofs, Discrete Applied Mathematics 18 (1987), 25\u201338.","journal-title":"Discrete Applied Mathematics"},{"key":"4884_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.26.1.19.10593","volume":"26","author":"W J Cook","year":"2001","unstructured":"W. J. Cook and S. Dash: On the matrix-cut rank of polyhedra, Mathematics of Operations Research 26 (2001), 19\u201330.","journal-title":"Mathematics of Operations Research"},{"key":"4884_CR19","first-page":"544","volume":"1","author":"W J Cook","year":"1990","unstructured":"W. J. Cook and M. Hartmann: On the complexity of branch and cut methods for the traveling salesman problem, Polyhedral Combinatorics 1 (1990), 544\u2013548.","journal-title":"Polyhedral Combinatorics"},{"key":"4884_CR20","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01580858","volume":"47","author":"W J Cook","year":"1990","unstructured":"W. J. Cook, R. Kannan and A. Schrijver: Chv\u00e1tal closures for mixed integer programming problems, Mathematical Programming 47 (1990), 544\u2013548.","journal-title":"Mathematical Programming"},{"key":"4884_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-009-0333-2","volume":"130","author":"G Cornu\u00e9jols","year":"2011","unstructured":"G. Cornu\u00e9jols, L. Liberti and G. Nannicini: Improved strategies for branching on general disjunctions, Mathematical Programming 130 (2011), 225\u2013247.","journal-title":"Mathematical Programming"},{"key":"4884_CR22","unstructured":"D. Dadush and S. Tiwari: On the complexity of branching proofs, arXiv: 2006.04124, 2020."},{"key":"4884_CR23","doi-asserted-by":"crossref","unstructured":"S. Dash: An exponential lower bound on the length of some classes of branch-and-cut proofs, in: International Conference on Integer Programming and Combinatorial Optimization (IPCO), 145\u2013160, Springer, 2002.","DOI":"10.1007\/3-540-47867-1_11"},{"key":"4884_CR24","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1287\/moor.1050.0151","volume":"30","author":"S Dash","year":"2005","unstructured":"S. Dash: Exponential lower bounds on the lengths of some classes of branch-and-cut proofs, Mathematics of Operations Research 30 (2005), 678\u2013700.","journal-title":"Mathematics of Operations Research"},{"key":"4884_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.orl.2009.10.010","volume":"38","author":"S Dash","year":"2010","unstructured":"S. Dash: On the complexity of cutting-plane proofs using split cuts, Operations Research Letters 38 (2010), 109\u2013114.","journal-title":"Operations Research Letters"},{"key":"4884_CR26","doi-asserted-by":"crossref","unstructured":"S. S. Dey, Y. Dubey and M. Molinaro: Lower bounds on the size of general branch-and-bound trees, arXiv: 2103.09807, 2021.","DOI":"10.1007\/s10107-022-01781-z"},{"key":"4884_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.orl.2015.03.007","volume":"43","author":"S S Dey","year":"2015","unstructured":"S. S. Dey, A. Iroume and M. Molinaro: Some lower bounds on sparse outer approximations of polytopes, Operations Research Letters 43 (2015), 323\u2013328.","journal-title":"Operations Research Letters"},{"key":"4884_CR28","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-015-0925-y","volume":"154","author":"S S Dey","year":"2015","unstructured":"S. S. Dey, M. Molinaro and Q. Wang: Approximating polyhedra with sparse inequalities, Mathematical Programming 154 (2015), 329\u2013352.","journal-title":"Mathematical Programming"},{"key":"4884_CR29","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/moor.2017.0866","volume":"43","author":"S S Dey","year":"2018","unstructured":"S. S. Dey, M. Molinaro and Q. Wang: Analysis of sparse cutting planes for sparse milps with applications to stochastic milps, Mathematics of Operations Research 43 (2018), 304\u2013332.","journal-title":"Mathematics of Operations Research"},{"key":"4884_CR30","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00493-003-0020-5","volume":"23","author":"F Eisenbrand","year":"2003","unstructured":"F. Eisenbrand and A. S. Schulz: Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1-cube, Combinatorica 23 (2003), 245\u2013261.","journal-title":"Combinatorica"},{"key":"4884_CR31","doi-asserted-by":"publisher","first-page":"191201","DOI":"10.1137\/0613016","volume":"13","author":"S K Eldersveld","year":"1992","unstructured":"S. K. Eldersveld and M. A. Saunders: A block-lu update for large-scale linear programming, SIAM Journal on Matrix Analysis and Applications 13 (1992), 191201.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"4884_CR32","unstructured":"N. Fleming, M. G\u00f6\u00f6s, R. Impagliazzo, T. Pitassi, R. Robere, L.-Y. Tan and A. Wigderson: On the power and limitations of branch and cut, arXiv: 2102.05019, 2021."},{"key":"4884_CR33","doi-asserted-by":"crossref","unstructured":"A. Goerdt: Cutting plane versus frege proof systems, in: International Workshop on Computer Science Logic, 174\u2013194, Springer, 1990.","DOI":"10.1007\/3-540-54487-9_59"},{"key":"4884_CR34","doi-asserted-by":"crossref","unstructured":"A. Goerdt: The cutting plane proof system with bounded degree of falsity, in: International Workshop on Computer Science Logic, 119\u2013133, Springer, 1991.","DOI":"10.1007\/BFb0023762"},{"key":"4884_CR35","doi-asserted-by":"crossref","unstructured":"D. Grigoriev, E. A. Hirsch and D. V. Pasechnik: Complexity of semi-algebraic proofs, in: Annual Symposium on Theoretical Aspects of Computer Science (STACS), 419\u2013430, Springer, 2002.","DOI":"10.1007\/3-540-45841-7_34"},{"key":"4884_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics: Study and Research Texts","author":"M Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver: Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics: Study and Research Texts, Springer-Verlag, Berlin, 1988."},{"key":"4884_CR37","doi-asserted-by":"crossref","unstructured":"E. A. Hirsch and S. I. Nikolenko: Simulating cutting plane proofs with restricted degree of falsity by resolution, in: International Conference on Theory and Applications of Satisfiability Testing, 135\u2013142, Springer, 2005.","DOI":"10.1007\/11499107_10"},{"key":"4884_CR38","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, T. Pitassi and A. Urquhart: Upper and lower bounds for treelike cutting planes proofs, in: Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 220\u2013228, IEEE, 1994.","DOI":"10.1109\/LICS.1994.316069"},{"key":"4884_CR39","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01580225","volume":"6","author":"R G Jeroslow","year":"1974","unstructured":"R. G. Jeroslow: Trivial integer programs unsolvable by branch-and-bound, Mathematical Programming 6 (1974), 105\u2013109.","journal-title":"Mathematical Programming"},{"key":"4884_CR40","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-009-0332-3","volume":"128","author":"M Karamanov","year":"2011","unstructured":"M. Karamanov and G. Cornu\u00e9jols: Branching on general disjunctions, Mathematical Programming 128 (2011), 403\u2013436.","journal-title":"Mathematical Programming"},{"key":"4884_CR41","doi-asserted-by":"crossref","unstructured":"A. Kojevnikov: Improved lower bounds for tree-like resolution over linear inequalities, in: International Conference on Theory and Applications of Satisfiability Testing, 70\u201379, Springer, 2007.","DOI":"10.1007\/978-3-540-72788-0_10"},{"key":"4884_CR42","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.2307\/2586668","volume":"63","author":"J Kraj\u00ed\u010dek","year":"1998","unstructured":"J. Kraj\u00ed\u010dek: Discretely ordered modules as a first-order extension of the cutting planes proof system, The Journal of Symbolic Logic 63 (1998), 1582\u20131596.","journal-title":"The Journal of Symbolic Logic"},{"key":"4884_CR43","doi-asserted-by":"crossref","unstructured":"A. Lodi: Mixed integer programming computation, in: 50 Years of Integer Programming 1958\u20132008, 619\u2013645, Springer, 2010.","DOI":"10.1007\/978-3-540-68279-0_16"},{"key":"4884_CR44","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz: An algorithmic theory of numbers, graphs, and convexity, volume 50, SIAM, 1986.","DOI":"10.1137\/1.9781611970203"},{"key":"4884_CR45","doi-asserted-by":"crossref","unstructured":"A. Mahajan and Th. K. Ralphs: Experiments with branching using general disjunctions, in: Operations Research and Cyber-Infrastructure, 101\u2013118, Springer, 2009.","DOI":"10.1007\/978-0-387-88843-9_6"},{"key":"4884_CR46","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.cor.2013.03.001","volume":"40","author":"H Mahmoud","year":"2013","unstructured":"H. Mahmoud and J. W. Chinneck: Achieving milp feasibility quickly using general disjunctions, Computers & operations research 40 (2013), 2094\u20132102.","journal-title":"Computers & operations research"},{"key":"4884_CR47","doi-asserted-by":"crossref","unstructured":"J. Ostrowski, J. Linderoth, F. Rossi and S. Smriglio: Constraint orbital branching, in: International Conference on Integer Programming and Combinatorial Optimization, 225\u2013239, Springer, 2008.","DOI":"10.1007\/978-3-540-68891-4_16"},{"key":"4884_CR48","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"J H Owen","year":"2001","unstructured":"J. H. Owen and S. Mehrotra: A disjunctive cutting plane procedure for general mixed-integer linear programs, Mathematical Programming 89 (2001), 437\u2013448.","journal-title":"Mathematical Programming"},{"key":"4884_CR49","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1011207119557","volume":"20","author":"J H Owen","year":"2001","unstructured":"J. H. Owen and S. Mehrotra: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programs, Computational optimization and applications 20 (2001), 159\u2013170.","journal-title":"Computational optimization and applications"},{"key":"4884_CR50","doi-asserted-by":"crossref","unstructured":"G. Pataki, M. Tural and E. B. Wong: Basis reduction and the complexity of branch-and-bound, in: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, 1254\u20131261, SIAM, 2010.","DOI":"10.1137\/1.9781611973075.100"},{"key":"4884_CR51","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P Pudl\u00e1k","year":"1997","unstructured":"P. Pudl\u00e1k: Lower bounds for resolution and cutting plane proofs and monotone computations, The Journal of Symbolic Logic 62 (1997), 981\u2013998.","journal-title":"The Journal of Symbolic Logic"},{"key":"4884_CR52","doi-asserted-by":"crossref","unstructured":"P. Pudl\u00e1k: On the complexity of the propositional calculus, London Mathematical Society Lecture Note Series, 197\u2013218, 1999.","DOI":"10.1017\/CBO9781107325944.010"},{"key":"4884_CR53","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1287\/moor.2016.0840","volume":"42","author":"A A Razborov","year":"2017","unstructured":"A. A. Razborov: On the width of semialgebraic proofs and algorithms, Mathematics of Operations Research 42 (2017), 1106\u20131134.","journal-title":"Mathematics of Operations Research"},{"key":"4884_CR54","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01585094","volume":"24","author":"J K Reid","year":"1982","unstructured":"J. K. Reid: A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases, Mathematical Programming 24 (1982), 55\u201369.","journal-title":"Mathematical Programming"},{"key":"4884_CR55","doi-asserted-by":"crossref","unstructured":"T. Rothvoss and L. Sanit\u00e0: 0\/1 polytopes with quadratic Chv\u00e1tal rank, in: International Conference on Integer Programming and Combinatorial Optimization (IPCO), 349\u2013361, Springer, 2013.","DOI":"10.1007\/978-3-642-36694-9_30"},{"key":"4884_CR56","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"A. Schrijver: Theory of Linear and Integer Programming, John Wiley and Sons, New York, 1986."},{"key":"4884_CR57","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"E. Sperner: Ein satz \u00fcber untermengen einer endlichen menge, Mathematische Zeitschrift 27 (1928), 544\u2013548.","journal-title":"Mathematische Zeitschrift"},{"key":"4884_CR58","unstructured":"R. J. Venderbei: Sparsity Matters, 2017. https:\/\/vanderbei.princeton.edu\/tex\/talks\/IDACCR\/SparsityMatters.pdf"},{"key":"4884_CR59","first-page":"544","volume":"42","author":"G N Watson","year":"1959","unstructured":"G. N. Watson: A note on gamma functions, Edinburgh Mathematical Notes 42 (1959), 544\u2013548.","journal-title":"Edinburgh Mathematical Notes"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-022-4884-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-022-4884-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-022-4884-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T13:32:43Z","timestamp":1728135163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-022-4884-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":59,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4884"],"URL":"https:\/\/doi.org\/10.1007\/s00493-022-4884-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"16 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}