{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:17:24Z","timestamp":1760707044101},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":[[2002,10]]},"DOI":"10.1016\/s0167-6377(02)00157-8","type":"journal-article","created":{"date-parts":[[2002,10,16]],"date-time":"2002-10-16T21:46:23Z","timestamp":1034804783000},"page":"336-342","source":"Crossref","is-referenced-by-count":13,"title":["Approximation algorithms for fractional knapsack problems"],"prefix":"10.1016","volume":"30","author":[{"given":"Alain","family":"Billionnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00157-8_BIB1","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero-one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB2","unstructured":"A. Billionnet, Computational experience with a 12-approximation algorithm for the hyperbolic 0-1 knapsack problem, CEDRIC Technical Report No. 105, Conservatoire National des Arts et M\u00e9tiers, Paris, 2000, 9p."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB3","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete variable extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB4","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","article-title":"On nonlinear fractional programming","volume":"13","author":"Dinkelbach","year":"1967","journal-title":"Manag. Sci."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01582890","article-title":"Hyperbolic 0-1 programming and query optimization in information retrieval","volume":"52","author":"Hansen","year":"1991","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02591737","article-title":"Approximation algorithms for combinatorial fractional programming problems","volume":"37","author":"Hashizume","year":"1987","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB7","doi-asserted-by":"crossref","unstructured":"D.S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.","DOI":"10.1145\/261342.571216"},{"key":"10.1016\/S0167-6377(02)00157-8_BIB8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01584342","article-title":"Fractional knapsack problems","volume":"13","author":"Ishii","year":"1977","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/S0167-6377(02)00157-8_BIB9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB10","unstructured":"S. Martello, P. Toth, Knapsack Problems, Wiley, England, 1990, 296p."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB11","doi-asserted-by":"crossref","first-page":"414","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\/S0167-6377(02)00157-8_BIB12","unstructured":"A. Nagih, Sur la r\u00e9solution des probl\u00e8mes fractionnaires en variables 0-1, Th\u00e8se de Doctorat, Universit\u00e9 Paris 13, France, juin 1996."},{"key":"10.1016\/S0167-6377(02)00157-8_BIB13","first-page":"299","article-title":"A Lagrangean decomposition for the 0-1 hyperbolic programming problem","volume":"1","author":"Nagih","year":"2000","journal-title":"Internat. J. Math. Algorithms"},{"key":"10.1016\/S0167-6377(02)00157-8_BIB14","series-title":"Combinatorial Optimization, Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0167-6377(02)00157-8_BIB15","series-title":"Handbook of Combinatorial Optimization","first-page":"429","article-title":"Fractional combinatorial optimization","author":"Radzik","year":"1998"},{"key":"10.1016\/S0167-6377(02)00157-8_BIB16","series-title":"Handbook of Global Optimization","first-page":"495","article-title":"Fractional programming","author":"Schaible","year":"1995"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T14:52:59Z","timestamp":1583851979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0167637702001578"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00157-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}