{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:46:35Z","timestamp":1752461195446},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7078,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0166-218x(94)90198-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"3-23","source":"Crossref","is-referenced-by-count":38,"title":["Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming"],"prefix":"10.1016","volume":"49","author":[{"given":"O.","family":"Bahn","sequence":"first","affiliation":[]},{"given":"J.L.","family":"Goffin","sequence":"additional","affiliation":[]},{"given":"J.P.","family":"Vial","sequence":"additional","affiliation":[]},{"given":"O.","family":"Du Merle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90198-8_BIB1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","article-title":"Newton's method of convex programming and Tchebycheff Approximation","volume":"1","author":"Cheney","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0166-218X(94)90198-8_BIB2","series-title":"Geometric Programming","author":"Duffin","year":"1967"},{"key":"10.1016\/0166-218X(94)90198-8_BIB3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","article-title":"A polynomial Newton method for linear programming","volume":"1","author":"de Ghellinck","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(94)90198-8_BIB4","series-title":"Decomposition and nondifferentiable optimization with the projective algorithm","author":"Goffin","year":"1989"},{"key":"10.1016\/0166-218X(94)90198-8_BIB5","series-title":"Manuscript","article-title":"Using central prices in the decomposition of linear programs","author":"Goffin","year":"1990"},{"key":"10.1016\/0166-218X(94)90198-8_BIB6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF00939559","article-title":"Cutting planes and column generation techniques with the projective algorithm","volume":"65","author":"Goffin","year":"1989","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/0166-218X(94)90198-8_BIB7","series-title":"Manuscript","article-title":"On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm","author":"Goffin","year":"1989"},{"key":"10.1016\/0166-218X(94)90198-8_BIB8","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\/0166-218X(94)90198-8_BIB9","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","article-title":"The cutting plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"J. Soc. Industrial Appl. Math."},{"key":"10.1016\/0166-218X(94)90198-8_BIB10","series-title":"Working Paper Series No. 90-7","article-title":"A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier","author":"Kortanek","year":"1990"},{"key":"10.1016\/0166-218X(94)90198-8_BIB11","series-title":"PhD Thesis","article-title":"Karmarkar's algorithm and combinatorial optimization problems","author":"Mitchell","year":"1988"},{"key":"10.1016\/0166-218X(94)90198-8_BIB12","series-title":"Pro-Matlab User's Guide","author":"Moler","year":"1987"},{"key":"10.1016\/0166-218X(94)90198-8_BIB13","first-page":"866","article-title":"An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming","volume":"84","author":"Sonnevend","year":"1985"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:27:06Z","timestamp":1555136826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0166218X94901988"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90198-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}