{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T12:47:28Z","timestamp":1750942048873},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1016\/j.orl.2008.02.004","type":"journal-article","created":{"date-parts":[[2008,3,11]],"date-time":"2008-03-11T10:27:42Z","timestamp":1205231262000},"page":"414-418","source":"Crossref","is-referenced-by-count":2,"title":["A redundant Klee\u2013Minty construction with all the redundant constraints touching the feasible region"],"prefix":"10.1016","volume":"36","author":[{"given":"Eissa","family":"Nematollahi","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2008.02.004_b1","series-title":"Activity Analysis of Production and Allocation","first-page":"339","article-title":"Maximization of a linear function of variables subject to linear inequalities","author":"Dantzig","year":"1951"},{"key":"10.1016\/j.orl.2008.02.004_b2","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1080\/10556780500407725","article-title":"The central path visits all the vertices of the Klee\u2013Minty cube","volume":"21","author":"Deza","year":"2006","journal-title":"Optimization Methods and Software"},{"key":"10.1016\/j.orl.2008.02.004_b3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-006-0044-x","article-title":"How good are interior-point methods? Klee\u2013Minty cubes tighten iteration-complexity bounds","volume":"113","author":"Deza","year":"2008","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.orl.2008.02.004_b4","series-title":"Complementarity, Duality, and Global Optimization","first-page":"217","article-title":"Central path curvature and iteration-complexity for redundant Klee\u2013Minty cubes","author":"Deza","year":"2006"},{"key":"10.1016\/j.orl.2008.02.004_b5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/j.orl.2008.02.004_b6","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/j.orl.2008.02.004_b7","series-title":"Inequalities III","first-page":"159","article-title":"How good is the simplex algorithm?","author":"Klee","year":"1972"},{"key":"10.1016\/j.orl.2008.02.004_b8","series-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","first-page":"131","article-title":"Pathways to the optimal set in linear programming","author":"Megiddo","year":"1988"},{"key":"10.1016\/j.orl.2008.02.004_b9","unstructured":"E. Nematollahi, T. Terlaky, A simpler and tighter redundant Klee\u2013Minty construction, Optimization Letters (in press)https:\/\/linproxy.fan.workers.dev:443\/http\/www.springerlink.com\/content\/x013qq7g16kg3347\/"},{"key":"10.1016\/j.orl.2008.02.004_b10","series-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"Roos","year":"2006"},{"key":"10.1016\/j.orl.2008.02.004_b11","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1007\/BFb0043914","article-title":"An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming","volume":"84","author":"Sonnevend","year":"1986","journal-title":"Lecture Notes in Control and Information Sciences"},{"key":"10.1016\/j.orl.2008.02.004_b12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","article-title":"Pivot rules for linear programming \u2014 a survey","volume":"46","author":"Terlaky","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.orl.2008.02.004_b13","series-title":"Interior-Point Algorithms: Theory and Analysis","author":"Ye","year":"1997"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637708000278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637708000278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T23:54:14Z","timestamp":1546214054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637708000278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["S0167637708000278"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2008.02.004","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}