{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T16:49:30Z","timestamp":1773766170476,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":[[1997,9]]},"DOI":"10.1016\/s0167-6377(97)00031-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:07:44Z","timestamp":1027602464000},"page":"55-64","source":"Crossref","is-referenced-by-count":6,"title":["Potential reduction algorithms for structured combinatorial optimization problems"],"prefix":"10.1016","volume":"21","author":[{"given":"J.P.","family":"Warners","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00031-X_BIB1","series-title":"Interior Point Methods in Mathematical Programming","first-page":"189","article-title":"Implementation of interior-point methods for large scale linear programs","author":"Andersen","year":"1996"},{"key":"10.1016\/S0167-6377(97)00031-X_BIB2","article-title":"GRAPH: Generating radiolink frequency assignment problems heuristically","author":"van Benthem","year":"1995"},{"key":"10.1016\/S0167-6377(97)00031-X_BIB3","series-title":"Direct Methods for Sparse Matrices","author":"Duff","year":"1989"},{"key":"10.1016\/S0167-6377(97)00031-X_BIB4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(95)00199-9","article-title":"Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid","volume":"94","author":"Flippo","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00031-X_BIB5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02283686","article-title":"Computational experience with an interior point algorithm on the Satisfiability problem","volume":"25","author":"Kamath","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00031-X_BIB6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/conm\/114\/1097880","article-title":"An interior-point approach to NP-complete problems \u2014 Part I","volume":"114","author":"Karmarkar","year":"1990","journal-title":"Contemp. Math."},{"key":"10.1016\/S0167-6377(97)00031-X_BIB7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","article-title":"An interior point algorithm to solve computationally difficult set covering problems","volume":"52","author":"Karmarkar","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(97)00031-X_BIB8","series-title":"Technical Report 96-149","article-title":"Solving linear systems with low-rank updates","author":"Roos","year":"1996"},{"key":"10.1016\/S0167-6377(97)00031-X_BIB9","first-page":"23","article-title":"An improvement on Karmarkar's algorithm for integer programming","volume":"21","author":"Shi","year":"1992","journal-title":"COAL Bull."},{"key":"10.1016\/S0167-6377(97)00031-X_BIB10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0719026","article-title":"Newton's method with a model trust region modifcation","volume":"19","author":"S\u00f6rensen","year":"1982","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0167-6377(97)00031-X_BIB11","article-title":"A potential reduction approach to the radio link frequency assignment problem","author":"Warners","year":"1995"},{"key":"10.1016\/S0167-6377(97)00031-X_BIB12","series-title":"LIPSOL \u2014 a MATLABTM toolkit for linear programming interior-point solvers","author":"Zhang","year":"1994"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763779700031X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763779700031X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:28:11Z","timestamp":1556573291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763779700031X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S016763779700031X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00031-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}