{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:51:28Z","timestamp":1761893488725},"reference-count":85,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0377-2217(02)00072-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:56:01Z","timestamp":1034610961000},"page":"322-337","source":"Crossref","is-referenced-by-count":33,"title":["Advances in design and implementation of optimization software"],"prefix":"10.1016","volume":"140","author":[{"given":"Istv\u00e1n","family":"Maros","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Haroon Khaliq","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0377-2217(02)00072-3_BIB1","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/138351.138377","article-title":"Precise computation using range arithmetic, via C++","volume":"18","author":"Aberth","year":"1992","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB2","series-title":"Michael Abrash's Graphics Programming Black Book","author":"Abrash","year":"1997"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB3","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1.2.84","article-title":"Data structures and programming techniques for the implementation of Karmarkar's algorithm","volume":"1","author":"Adler","year":"1989","journal-title":"ORSA Journal in Computing"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB4","unstructured":"AMD Athlon Processor Technical Brief, Publication #22054 Rev:D, December 1999"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB5","series-title":"Interior Point Methods of Mathematical Programming","first-page":"189","article-title":"Implementation of interior point methods for large scale linear programs","volume":"vol. 5","author":"Andersen","year":"1996"},{"issue":"2","key":"10.1016\/S0377-2217(02)00072-3_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01586000","article-title":"Presolving in linear programming","volume":"71","author":"Anderson","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/BF01584344","article-title":"The efficient solution of large-scale linear programming problems","volume":"13","author":"Benichou","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB8","series-title":"Practical Algorithms for Programmers","author":"Binstock","year":"1995"},{"issue":"3","key":"10.1016\/S0377-2217(02)00072-3_BIB9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.4.3.267","article-title":"Implementing the simplex method: The initial basis","volume":"4","author":"Bixby","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB10","first-page":"12","article-title":"An updated mixed integer programming library: MIPLIB 3.0","volume":"54","author":"Bixby","year":"1998","journal-title":"Optima"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","article-title":"New finite pivot rule for the simplex method","volume":"2","author":"Bland","year":"1977","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00072-3_BIB12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","article-title":"CUTE: Constrained and unconstrained testing environment","volume":"21","author":"Bongartz","year":"1995","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","article-title":"Analysis of mathematical programming problems prior to applying the simplex method","volume":"8","author":"Brearley","year":"1975","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB14","series-title":"GAMS","author":"Brooke","year":"1998"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB15","series-title":"Efficient C++: Performance Programming Techniques","author":"Bulka","year":"2000"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB16","series-title":"Parallel Algorithms and Architectures","author":"Cosnard","year":"1995"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB17","series-title":"Parallel Computer Architecture: A Hardware\/Software Approach","author":"Culler","year":"1999"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB18","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1093\/imamat\/10.1.118","article-title":"On the automatic scaling of matrices for Gaussian elimination","volume":"10","author":"Curtis","year":"1972","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB19","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"issue":"August","key":"10.1016\/S0377-2217(02)00072-3_BIB20","first-page":"12","article-title":"Impact of linear programming on computer development","author":"Dantzig","year":"1988","journal-title":"OR\/MS Today"},{"issue":"2","key":"10.1016\/S0377-2217(02)00072-3_BIB21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/1037042","article-title":"Software libraries for linear algebra computations on high performance computers","volume":"37","author":"Dongarra","year":"1995","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB22","series-title":"Direct Methods for Sparse Matrices","author":"Duff","year":"1986"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02023049","article-title":"Vector processing in simplex and interior point methods","volume":"22","author":"Forrest","year":"1990","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00072-3_BIB24","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","article-title":"Steepest edge simplex algorithms for linear programming","volume":"57","author":"Forrest","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB25","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1147\/sj.311.0026","article-title":"Implementing interior point linear programming methods in the optimization subroutine library","volume":"31","author":"Forrest","year":"1992","journal-title":"IBM Systems Journal"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB26","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1147\/sj.311.0011","article-title":"Implementing the simplex method in the optimization subroutine library","volume":"31","author":"Forrest","year":"1992","journal-title":"IBM Systems Journal"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB27","series-title":"AMPL: A Modeling Language for Mathematical Programming","author":"Fourer","year":"1993"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB28","first-page":"10","article-title":"Electronic mail distribution of linear programming test problems","volume":"13","author":"Gay","year":"1985","journal-title":"COAL Newsletter"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB29","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","article-title":"A practical anti-cycling procedure for linearly constrained optimization","volume":"45","author":"Gill","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB30","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01593804","article-title":"A practicable steepest-edge simplex algorithm","volume":"12","author":"Goldfarb","year":"1977","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0377-2217(02)00072-3_BIB31","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","article-title":"Presolve analysis of linear programs prior to applying an interior point method","volume":"9","author":"Gondzio","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB32","series-title":"Advances in Linear and Integer Programming","first-page":"103","article-title":"A computational view of interior point methods","author":"Gondzio","year":"1996"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB33","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/BF01589115","article-title":"New crash procedures for large systems of linear constraints","volume":"45","author":"Gould","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB34","doi-asserted-by":"crossref","unstructured":"H.J. Greenberg, Pivot selection tactics, in: [36], pp. 143\u2013174","DOI":"10.1007\/978-94-009-9935-0_6"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB35","doi-asserted-by":"crossref","unstructured":"H.J. Greenberg, A tutorial on matricial packing, in: [36], pp. 109\u2013142","DOI":"10.1007\/978-94-009-9935-0_5"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB36","series-title":"Design and Implementation of Optimization Software","year":"1978"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB37","series-title":"A Computer-Assisted Analysis System for Mathematical Programming Models and Solutions: A User's Guide for ANALYZE","author":"Greenberg","year":"1993"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","article-title":"Pivot selection method of the Devex LP code","volume":"5","author":"Harris","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB39","series-title":"Computer Architecture and Organization","author":"Hayes","year":"1998"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB40","series-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy","year":"1996"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB41","series-title":"Proceedings of the 1971 Annual Conference of the ACM","first-page":"304","article-title":"Aspects of large-scale in-core linear programming","author":"Kalan","year":"1971"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB42","series-title":"The C Programming Language","author":"Kernighan","year":"1988"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB43","unstructured":"A. Klaiber, The Technology Behind Crusoe Processors, Transmeta Corporation, January 2000"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB44","unstructured":"U. Kulisch, The fifth floating-point operation for top-performance computers, Technical report, Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Karlsruhe, 1997"},{"issue":"4","key":"10.1016\/S0377-2217(02)00072-3_BIB45","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(96)83270-6","article-title":"Gigaflops in linear programming","volume":"18","author":"Lustig","year":"1996","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB46","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","article-title":"Computational experience with a primal dual interior point method for linear programming","volume":"152","author":"Lustig","year":"1991","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB47","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","article-title":"On implementing Mehrotra's predictor\u2013corrector interior point method for linear programming","volume":"2","author":"Lustig","year":"1992","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"10.1016\/S0377-2217(02)00072-3_BIB48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","article-title":"Interior point methods for linear programming: Computational state of the art","volume":"6","author":"Lustig","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB49","series-title":"The Design and Implementation of the 4.4BSD Operating System","author":"Karels","year":"1996"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB50","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(86)90215-8","article-title":"A general Phase-I method in linear programming","volume":"23","author":"Maros","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB51","series-title":"Mathematical Models for Decision Support","first-page":"263","article-title":"A multicriteria decision problem within the simplex method","author":"Maros","year":"1988"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB52","unstructured":"I. Maros, A structure exploiting pricing procedure for network linear programming, Research Report 18\u201391, RUTCOR, Rutgers University, NJ, USA, May 1991, 15 p"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB53","series-title":"New Trends in Mathematical Programming","first-page":"159","article-title":"A piecewise linear dual procedure in mixed integer programming","author":"Maros","year":"1998"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB54","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02032307","article-title":"A numerically exact implementation of the simplex method","volume":"58","author":"Maros","year":"1995","journal-title":"Annals of Operations Research"},{"issue":"December","key":"10.1016\/S0377-2217(02)00072-3_BIB55","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1080\/10556789908805768","article-title":"A repository of convex quadratic programming problems","volume":"11&12","author":"Maros","year":"1999","journal-title":"Optimization Methods and Software"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB56","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0167-8191(99)00100-3","article-title":"Investigating the sparse simplex algorithm on a distributed memory multiprocessor","volume":"26","author":"Maros","year":"2000","journal-title":"Parallel Computing"},{"issue":"2","key":"10.1016\/S0377-2217(02)00072-3_BIB57","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/ijoc.10.2.248","article-title":"Strategies for creating advanced bases for large-scale linear programming problems","volume":"10","author":"Maros","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB58","first-page":"487","article-title":"XMP: A structured library of subroutines for experimental mathematical programming","volume":"7","author":"Marsten","year":"1981","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB59","unstructured":"MPL Modeling system, Maximal Software. Available from http:\/\/www.maximal-usa.com\/mpl\/"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB60","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","article-title":"An implementation of a primal\u2013dual interior point method for linear programming","volume":"1","author":"McShane","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB61","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","article-title":"On the implementation of a primal\u2013dual interior point method","volume":"2","author":"Mehrotra","year":"1992","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB62","unstructured":"H.D. Mittelmann, P. Spellucci, Decision tree for optimization software. Available from <http:\/\/plato.la.asu.edu\/guide.html>"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB63","unstructured":"B.A. Murtagh, M.A. Saunders, MINOS 5. 1 User's Guide, Technical Report SOL 83\u201320R, Stanford University, 1987"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB64","series-title":"Advanced Linear-Programming Computing Techniques","author":"Orchard-Hays","year":"1968"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB65","series-title":"Parallel Programming With MPI","author":"Pacheco","year":"1997"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB66","unstructured":"AIMMS, Paragon decision technology. Available from <http:\/\/www.aimms.com\/index.html>"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB67","series-title":"Computer Organization and Design: The Hardware\u2013Software Interface","author":"Patterson","year":"1998"},{"issue":"1","key":"10.1016\/S0377-2217(02)00072-3_BIB68","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/156301.156303","article-title":"When floating-point addition isn't commutative","volume":"28","author":"Ris","year":"1993","journal-title":"SIGNUM Newsletter"},{"issue":"1","key":"10.1016\/S0377-2217(02)00072-3_BIB69","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1145\/42288.42343","article-title":"Best ordering for floating-point addition","volume":"14","author":"Robertazzi","year":"1988","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB70","series-title":"Theory and Algorithms for Linear Optimization","author":"Roos","year":"1997"},{"issue":"3","key":"10.1016\/S0377-2217(02)00072-3_BIB71","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/114697.116809","article-title":"Efficient sparse matrix factorization on high performance workstations exploiting the memory hierarchy","volume":"17","author":"Rothberg","year":"1991","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB72","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","article-title":"Preprocessing and probing for mixed integer programming problems","volume":"6","author":"Savelsbergh","year":"1994","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(02)00072-3_BIB73","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/381866.381884","article-title":"The transition of numerical software: From nuts-and-bolts to abstraction","volume":"33","author":"Smith","year":"1998","journal-title":"SIGNUM Newsletter"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB74","series-title":"MPI \u2013 The Complete Reference, Volume 1, The MPI Core","author":"Snir","year":"1999"},{"issue":"6","key":"10.1016\/S0377-2217(02)00072-3_BIB75","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/S0305-0548(96)00066-4","article-title":"Implementation of an integer optimization platform using object-oriented programming","volume":"24","author":"Solanki","year":"1997","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00072-3_BIB76","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1287\/ijoc.2.4.325","article-title":"Computing sparse LU factorizations for large-scale linear programming bases","volume":"2","author":"Suhl","year":"1990","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"10.1016\/S0377-2217(02)00072-3_BIB77","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1018317206484","article-title":"A new steepest edge approximation for the simplex method for linear programming","volume":"10","author":"Swietanowski","year":"1998","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB78","series-title":"Advanced Microprocessors","author":"Tabak","year":"1995"},{"issue":"6","key":"10.1016\/S0377-2217(02)00072-3_BIB79","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1147\/rd.416.0711","article-title":"Improving the memory-system performance of sparse-matrix vector multiplication","volume":"41","author":"Toledo","year":"1997","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"10.1016\/S0377-2217(02)00072-3_BIB80","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0305-0548(91)90090-E","article-title":"Parallel processing and OR\/MS","volume":"18","author":"Trippi","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB81","series-title":"The OPL Optimization Programming Language","author":"Van Henteryck","year":"1999"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB82","series-title":"Improving Floating-Point Programming","author":"Wallis","year":"1990"},{"issue":"1","key":"10.1016\/S0377-2217(02)00072-3_BIB83","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/1007004","article-title":"The composite simplex algorithm","volume":"7","author":"Wolfe","year":"1965","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB84","series-title":"Primal\u2013Dual Interior Point Methods","author":"Wright","year":"1996"},{"key":"10.1016\/S0377-2217(02)00072-3_BIB85","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02592190","article-title":"Superlinear and quadratic convergence of some primal\u2013dual interior point methods for constrained optimization","volume":"75","author":"Yamashita","year":"1996","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000723?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000723?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:56:43Z","timestamp":1556438203000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702000723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":85,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0377221702000723"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00072-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}