{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:07:00Z","timestamp":1648836420010},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":8386,"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":[[1990,8]]},"DOI":"10.1016\/0166-218x(90)90111-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"135-147","source":"Crossref","is-referenced-by-count":1,"title":["Resource allocation under limited sharing"],"prefix":"10.1016","volume":"28","author":[{"given":"Michael A.","family":"Langston","sequence":"first","affiliation":[]},{"given":"Michael P.","family":"Morford","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90111-O_BIB1","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BF01762131","article-title":"On finding optimal and near-optimal lineal spanning trees","volume":"3","author":"Fellows","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(90)90111-O_BIB2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","article-title":"Variable sized bin packing","volume":"15","author":"Friesen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90111-O_BIB3","unstructured":"D.K. Friesen and M.A. Langston, Analysis of a compound bin packing algorithm (to appear)."},{"key":"10.1016\/0166-218X(90)90111-O_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(90)90111-O_BIB5","series-title":"Vol. 2: Seminumerical Algorithms","article-title":"The Art of Computer Programming","author":"Knuth","year":"1969"},{"key":"10.1016\/0166-218X(90)90111-O_BIB6","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(90)90111-O_BIB7","series-title":"Computer Science Tech. Rept. CS-87-164","article-title":"Resource allocation under limited sharing","author":"Langston","year":"1987"},{"key":"10.1016\/0166-218X(90)90111-O_BIB8","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(90)90111-O_BIB9","series-title":"M.S. Thesis","article-title":"Analysis of the square-the-histogram method for generating discrete random variables","author":"Tsang","year":"1980"},{"key":"10.1016\/0166-218X(90)90111-O_BIB10","first-page":"325","article-title":"A decision tree algorithm for squaring the histogram in random number generation","author":"Tsang","year":"1986","journal-title":"Proceedings Australia-Singapore Joint Conference on Information Processing and Combinatorial Mathematics"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090111O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090111O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:25Z","timestamp":1555135045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090111O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["0166218X9090111O"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90111-o","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}