{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T20:22:14Z","timestamp":1697142134670},"reference-count":12,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1080\/10556780500407725","type":"journal-article","created":{"date-parts":[[2006,5,3]],"date-time":"2006-05-03T23:05:08Z","timestamp":1146697508000},"page":"851-865","source":"Crossref","is-referenced-by-count":9,"title":["The central path visits all the vertices of the Klee\u2013Minty cube"],"prefix":"10.1080","volume":"21","author":[{"given":"Antoine","family":"Deza","sequence":"first","affiliation":[]},{"given":"Eissa","family":"Nematollahi","sequence":"additional","affiliation":[]},{"given":"Reza","family":"Peyghami","sequence":"additional","affiliation":[]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","first-page":"339","volume-title":"Activity Analysis of Production and Allocation","author":"Dantzig G. B.","year":"1951"},{"key":"CIT0002","first-page":"159","volume-title":"Inequalities III","author":"Klee V.","year":"1972"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096264"},{"key":"CIT0004","first-page":"191","volume":"20","author":"Khachiyan L. G.","year":"1979","journal-title":"Soviet Mathematics Doklady"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"CIT0006","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"Roos C.","year":"1997"},{"key":"CIT0007","volume-title":"Interior-Point Algorithms: Theory and Analysis","author":"Ye Y.","year":"1979"},{"key":"CIT0008","doi-asserted-by":"crossref","volume-title":"Primal-Dual Interior-Point Methods","author":"Wright S. J.","year":"1997","DOI":"10.1137\/1.9781611971453"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/BF02206818"},{"key":"CIT0010","unstructured":"Deza, A., Nematollahi, E. and Terlaky, T. 2004. \u201cHow good are interior point methods? Klee\u2013Minty cubes tighten iteration\u2013complexity bounds\u201d. AdvOL-Report 2004\/20, McMaster University"},{"key":"CIT0011","first-page":"131","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"Megiddo N.","year":"1986"},{"key":"CIT0012","unstructured":"Sonnevend, G. An \u201canalytical centre\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. System Modelling and Optimization: Proceedings of the 12th IFIP-Conferenc. 1985, Budapest. Edited by: Pr\u00e9kopa, A., Szelezs\u00e1n, J. and Strazicky, B. pp.866\u2013876. New York: Springer. Also Lecture Notes in Control and Information Sciences 84, 1986"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556780500407725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T11:39:50Z","timestamp":1555587590000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10556780500407725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["10.1080\/10556780500407725"],"URL":"https:\/\/doi.org\/10.1080\/10556780500407725","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}