{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:28:54Z","timestamp":1757626134644,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,4,5]],"date-time":"2000-04-05T00:00:00Z","timestamp":954892800000},"content-version":"vor","delay-in-days":1921,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0166-218x(93)e0132-i","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:52:12Z","timestamp":1027590732000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Joint performance of greedy heuristics for the integer knapsack problem"],"prefix":"10.1016","volume":"56","author":[{"given":"Rajeev","family":"Kohli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0132-I_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","article-title":"Worst-case analysis of heuristic algorithms","volume":"26","author":"Fisher","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)E0132-I_BIB2","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0132-I_BIB3","article-title":"Analysis of a compound bin packing algorithm","author":"Friesen","year":"1989","journal-title":"Manuscript CS-89-96"},{"year":"1979","author":"Garey","key":"10.1016\/0166-218X(93)E0132-I_BIB4"},{"year":"1984","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","key":"10.1016\/0166-218X(93)E0132-I_BIB5"},{"key":"10.1016\/0166-218X(93)E0132-I_BIB6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)E0132-I_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6377(92)90065-B","article-title":"A total-value greedy heuristic for the integer knapsack problem","volume":"12","author":"Kohli","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(93)E0132-I_BIB8","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.35.4.556","article-title":"Interstage transportation planning in the deterministic flow-shop environment","volume":"35","author":"Langston","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)E0132-I_BIB9","series-title":"Proceedings of the 18th Annual Symposium on Foundations of Computer Science","first-page":"206","article-title":"Fast approximation algorithms for knapsack problems","author":"Lawler","year":"1977"},{"key":"10.1016\/0166-218X(93)E0132-I_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","article-title":"New algorithms for bin packing","volume":"27","author":"Yao","year":"1980","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0132I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0132I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:50:31Z","timestamp":1757451031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0132I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0166218X93E0132I"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0132-i","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1995,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Joint performance of greedy heuristics for the integer knapsack problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(93)E0132-I","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}