{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:27Z","timestamp":1747548327336},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0167-6377(92)90104-b","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"181-186","source":"Crossref","is-referenced-by-count":14,"title":["A build-up variant of the logarithmic barrier method for LP"],"prefix":"10.1016","volume":"12","author":[{"given":"D","family":"den Hertog","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90104-B_BIB1","series-title":"Technical Report SOL 90-4","article-title":"A build-up interior method for linear programming: Affine scaling form","author":"Dantzig","year":"1990"},{"key":"10.1016\/0167-6377(92)90104-B_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0802006","article-title":"A complexity reduction for the long-step path-following algorithm for linear programming","volume":"2\/1","author":"Den Hertog","year":"1992","journal-title":"SIAM J. Optim."},{"key":"10.1016\/0167-6377(92)90104-B_BIB3","first-page":"409","article-title":"Cutting planes and column generation techniques with the projective algorithm","volume":"65","author":"Goffin","year":"1990","journal-title":"SIAM J. Optim."},{"key":"10.1016\/0167-6377(92)90104-B_BIB4","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\/0167-6377(92)90104-B_BIB5","article-title":"Karmarkar's algorithm and combinatorial optimization problems","author":"Mitchell","year":"1988"},{"key":"10.1016\/0167-6377(92)90104-B_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","article-title":"Interior path following primal-dual algorithms, Part I: linear programming","volume":"44","author":"Monteiro","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90104-B_BIB7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","article-title":"A polynomial-time algorithm, based on Newton's method, for linear programming","volume":"40","author":"Renegar","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90104-B_BIB8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","article-title":"A polynomial method of approximate centers for linear programming","volume":"54\/3","author":"Roos","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90104-B_BIB9","series-title":"Economic Decision-Making: Games, Economics and Optimization","first-page":"433","article-title":"Long steps with the logarithmic penalty barrier function in linear programming","author":"Roos","year":"1989"},{"key":"10.1016\/0167-6377(92)90104-B_BIB10","series-title":"Working Paper","first-page":"338","article-title":"An active-set strategy in interior point method for linear programming","author":"Tone","year":"1991"},{"key":"10.1016\/0167-6377(92)90104-B_BIB11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","article-title":"An O(n3L) potential reduction algorithm for linear programming","volume":"50","author":"Ye","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90104-B_BIB12","series-title":"Working Paper Series No. 89-7","article-title":"Eliminating columns and rows in potential reduction and path-following algorithms for linear programming","author":"Ye","year":"1991"},{"key":"10.1016\/0167-6377(92)90104-B_BIB13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0802002","article-title":"A potential reduction algorithm allowing column generation","volume":"2","author":"Ye","year":"1992","journal-title":"SIAM J. Optim."},{"key":"10.1016\/0167-6377(92)90104-B_BIB14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01585727","article-title":"The \u201cbuild-down\u201d scheme for linear programming","volume":"46","author":"Ye","year":"1990","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290104B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290104B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:50:44Z","timestamp":1552888244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290104B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["016763779290104B"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90104-b","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}