{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:37:40Z","timestamp":1772372260835,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advances in Applied Mathematics"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0196-8858(02)00526-2","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T17:33:30Z","timestamp":1049477610000},"page":"96-109","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Polytopes, permutation shapes and bin packing"],"prefix":"10.1016","volume":"30","author":[{"given":"Marguerite A.","family":"Eisenstein-Taylor","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-8858(02)00526-2_BIB001","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","article-title":"On a dual version of the one-dimensional bin packing problem","volume":"5","author":"Assman","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB002","doi-asserted-by":"crossref","DOI":"10.1007\/BF01170773","article-title":"Enumeration of pairs of sequences by rises, falls, and levels","volume":"19","author":"Carlitz","year":"1976","journal-title":"Manuscripta Math."},{"key":"10.1016\/S0196-8858(02)00526-2_BIB003","series-title":"Polytopes, permutations, and the bin packing problems, PhD thesis","author":"Eisenstein-Taylor","year":"2001"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB004","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1080\/00029890.1991.11995752","article-title":"A coloring problem","volume":"98","author":"Gessel","year":"1991","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB005","unstructured":"I. Gessel, Generating functions and enumeration of sequences, PhD thesis, Massachusetts Institute of Technology, 1977"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB006","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0097-3165(78)90042-0","article-title":"Stirling polynomials","volume":"24","author":"Gessel","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB007","series-title":"Combinatorial Enumeration","author":"Goulden","year":"1983"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB008","series-title":"Probabilistic Analysis of Algorithms","author":"Hofri","year":"1987"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB009","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/0196-6774(84)90007-5","article-title":"A probabilistic analysis of the next-fit bin packing algorithm","volume":"5","author":"Hofri","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB010","first-page":"153","article-title":"Barred permutations","volume":"95","author":"Klingsburg","year":"1993","journal-title":"Congr. Numer."},{"key":"10.1016\/S0196-8858(02)00526-2_BIB011","series-title":"Enumerative Combinatorics","author":"Stanley","year":"1997"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB012","article-title":"Eulerian partitions of a unit hypercube","author":"Stanley","year":"1977"},{"key":"10.1016\/S0196-8858(02)00526-2_BIB013","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187680","article-title":"Two poset polytopes","volume":"1","author":"Stanley","year":"1986","journal-title":"Discrete Comput. Geometry"}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885802005262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885802005262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:45:15Z","timestamp":1759301115000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196885802005262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0196885802005262"],"URL":"https:\/\/doi.org\/10.1016\/s0196-8858(02)00526-2","relation":{},"ISSN":["0196-8858"],"issn-type":[{"value":"0196-8858","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polytopes, permutation shapes and bin packing","name":"articletitle","label":"Article Title"},{"value":"Advances in Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0196-8858(02)00526-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science (USA). All rights reserved.","name":"copyright","label":"Copyright"}]}}