{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:28:39Z","timestamp":1778498919287,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,3]],"date-time":"2012-02-03T00:00:00Z","timestamp":1328227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10898-012-9856-9","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T18:22:59Z","timestamp":1328638979000},"page":"1457-1462","source":"Crossref","is-referenced-by-count":34,"title":["A note on a selfish bin packing problem"],"prefix":"10.1007","volume":"56","author":[{"given":"Ruixin","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,3]]},"reference":[{"issue":"2","key":"9856_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0602019","volume":"2","author":"B.S. Baker","year":"1981","unstructured":"Baker B.S., Coffman E.G.: Next-fit packs a list and its reverse into the same number of bins. SIAM J. Algebra. Discret. Methods 2(2), 147\u2013152 (1981)","journal-title":"SIAM J. Algebra. Discret. Methods"},{"key":"9856_CR2","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V.: On the packing of selfish items. In: The 20th IEEE International Parallel and Distributed Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639283"},{"key":"9856_CR3","volume-title":"Handbook of Applied Optimization","author":"E.G. Coffman","year":"2002","unstructured":"Coffman E.G., Csirik J., Woeginger G.: Bin packing theory. In: Pardalos, P., Resende, M. (eds) Handbook of Applied Optimization, Oxford University Press, New York (2002)"},{"key":"9856_CR4","volume-title":"Handbook of Combinatorial Optimization","author":"E.G. Coffman","year":"1998","unstructured":"Coffman E.G., Galambos G., Martello S., Vigo D.: Bin packing appoximation algorithms: combinatorial analysis. In: Du, D., Pardalos, P. (eds) Handbook of Combinatorial Optimization, Kluwer, Amsterdam (1998)"},{"key":"9856_CR5","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman","year":"1997","unstructured":"Coffman E.G., Garey M.R., Johnson D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston (1997)"},{"issue":"2","key":"9856_CR6","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/s00453-009-9348-6","volume":"60","author":"L. Epstein","year":"2011","unstructured":"Epstein L., Kleiman E.: Selfish bin packing. Algorithmica 60(2), 368\u2013394 (2011)","journal-title":"Algorithmica"},{"key":"9856_CR7","doi-asserted-by":"crossref","unstructured":"Epstein, L., Kleiman, E., Mestre, J.: Parametric packing of selfish items and the subset sum algorithm. In: The Fifth Workshop on Internet and Network Economics, pp. 67\u201378 (2009)","DOI":"10.1007\/978-3-642-10841-9_8"},{"issue":"6","key":"9856_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0167-6377(88)90060-0","volume":"7","author":"D.C. Fisher","year":"1988","unstructured":"Fisher D.C.: Next-fit packs a list and its reverse into the same number of bins. Oper. Res. Lett. 7(6), 291\u2013293 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9856_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"Garey M.R., Graham R.L., Johnson D.S.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory Ser. A 21(3), 257\u2013298 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9856_CR10","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Ullman, J.D.: Worst-case analysis of memory allocation algorithms. In: The 4th ACM Symposium on Theory of Computing, pp. 143\u2013150 (1972)","DOI":"10.1145\/800152.804907"},{"issue":"4","key":"9856_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson D.S., Demers A.J., Ullman J.D., Garey M.R., Graham R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"9856_CR12","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: The 23st Annual IEEE Symposium on Foundations of Computer Science, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"9856_CR13","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: The Symposium on Theoretical Aspects of Computer Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9856_CR14","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: The 33th ACM Symposium on Theory of Computing, pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"9856_CR15","doi-asserted-by":"crossref","unstructured":"Onn, S.: Convex discrete optimization. In: Encyclopedia of Optimization, pp. 513\u2013550 (2009)","DOI":"10.1007\/978-0-387-74759-0_94"},{"key":"9856_CR16","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"9856_CR17","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? In: The 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"key":"9856_CR18","doi-asserted-by":"crossref","unstructured":"Yu, G., Zhang, G.: Bin packing of selfish items. In: The 14th Workshop on Internet and Network Economics, pp. 446\u2013453 (2008)","DOI":"10.1007\/978-3-540-92185-1_50"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9856-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9856-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9856-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T01:19:12Z","timestamp":1742433552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9856-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,3]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9856"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9856-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,3]]}}}