{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:21Z","timestamp":1759063641426},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"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":8417,"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,7]]},"DOI":"10.1016\/0166-218x(90)90089-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:02:11Z","timestamp":1027652531000},"page":"3-9","source":"Crossref","is-referenced-by-count":10,"title":["The permutahedron of series-parallel posets"],"prefix":"10.1016","volume":"28","author":[{"given":"Annelie","family":"Von Arnim","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Faigle","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Schrader","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90089-U_BIB1","article-title":"A linear characterization of permutation vectors","volume":"364","author":"Balas","year":"1975"},{"key":"10.1016\/0166-218X(90)90089-U_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0132025","article-title":"Adjacent vertices on a permutahedron","volume":"32","author":"Gaiha","year":"1977","journal-title":"SIAM J. Applied Math."},{"key":"10.1016\/0166-218X(90)90089-U_BIB3","first-page":"75","article-title":"Sequencing jobs to minimize weighted completion time subject to precedence constraints","volume":"2","author":"Lawler","year":"1978"},{"key":"10.1016\/0166-218X(90)90089-U_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/jlms\/s1-27.1.1","article-title":"An inequality","volume":"27","author":"Rado","year":"1952","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0166-218X(90)90089-U_BIB5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1287\/opre.23.2.283","article-title":"Decomposition algorithm for single-machine sequencing with precedence relations and deferral costs","volume":"22","author":"Sidney","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90089-U_BIB6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0121198","article-title":"On permutations and permutation polytopes","volume":"8","author":"Young","year":"1978","journal-title":"Math. Programming Stud."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090089U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090089U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:53:35Z","timestamp":1555199615000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090089U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0166218X9090089U"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90089-u","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}