{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T13:15:55Z","timestamp":1675343755993},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0020-0190(97)00142-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"173-177","source":"Crossref","is-referenced-by-count":2,"title":["An efficient, strongly polynomial, \u03b5-approximation parametric optimization scheme"],"prefix":"10.1016","volume":"64","author":[{"given":"S.N.","family":"Kabadi","sequence":"first","affiliation":[]},{"given":"Y.P.","family":"Aneja","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00142-7_BIB1","article-title":"Polynomial algorithms for Lagrangean relaxations in combinatorial problems","author":"Aneja","year":"1991","journal-title":"University of Windsor, Faculty of Business, Working Paper Series No. W91-03, ISSN No. 0714-6191"},{"key":"10.1016\/S0020-0190(97)00142-7_BIB2","series-title":"Working paper","article-title":"Lagrangean relaxation of certain constrained NP-hard combinatorial problems","author":"Aneja","year":"1994"},{"key":"10.1016\/S0020-0190(97)00142-7_BIB3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0377-2217(94)00009-2","article-title":"Ratio combinatorial programs","volume":"81","author":"Aneja","year":"1995","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/S0020-0190(97)00142-7_BIB4","series-title":"Complexity in Numerical Optimization","first-page":"74","article-title":"Maximizing concave functions in fixed dimensions","author":"Cohen","year":"1993"},{"key":"10.1016\/S0020-0190(97)00142-7_BIB5","series-title":"Working paper","article-title":"Equivalence of \u03b5-approximate separation and optimization in fixed dimensions","author":"Kabadi","year":"1994"},{"key":"10.1016\/S0020-0190(97)00142-7_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6377(95)00028-3","article-title":"\u03b5-approximation minimization in fixed dimensions","volume":"18","author":"Kabadi","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0020-0190(97)00142-7_BIB7","series-title":"Working paper","article-title":"Strong polynomiality of Newton's method in general, fixed dimension","author":"Kabadi","year":"1996"},{"key":"10.1016\/S0020-0190(97)00142-7_BIB8","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/moor.4.4.414","article-title":"Combinatorial optimization with rational objective functions","volume":"4","author":"Megiddo","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(97)00142-7_BIB9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0196-6774(92)90006-X","article-title":"Using separation algorithms in fixed dimensions","volume":"13","author":"Norton","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00142-7_BIB10","series-title":"Complexity in Numerical Optimization","first-page":"351","article-title":"Parametric flows, weighted means of cuts, and fractional combinatorial optimization","author":"Radzik","year":"1993"},{"key":"10.1016\/S0020-0190(97)00142-7_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(93)90149-4","article-title":"Approximate parametric searching","volume":"47","author":"Toledo","year":"1993","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001427?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001427?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:54:55Z","timestamp":1556376895000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0020019097001427"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00142-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}