{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T13:46:37Z","timestamp":1744897597954},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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":8355,"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,9]]},"DOI":"10.1016\/0166-218x(90)90002-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"197-205","source":"Crossref","is-referenced-by-count":13,"title":["An algorithmic characterization of antimatroids"],"prefix":"10.1016","volume":"28","author":[{"given":"E.Andrew","family":"Boyd","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Faigle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90002-T_BIB1","first-page":"25","article-title":"On matroids, groups, exchange languages","author":"Bj\u00f6rner","year":"1985"},{"key":"10.1016\/0166-218X(90)90002-T_BIB2","author":"Bj\u00f6rner","year":"1986"},{"key":"10.1016\/0166-218X(90)90002-T_BIB3","article-title":"Optimization problems on greedoids","author":"Boyd","year":"1987"},{"key":"10.1016\/0166-218X(90)90002-T_BIB4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02482912","article-title":"Meet-distributive lattices and anti-exchange closure","volume":"10","author":"Edelman","year":"1980","journal-title":"Algebra Universalis"},{"key":"10.1016\/0166-218X(90)90002-T_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(79)90092-X","article-title":"The greedy algorithm for partially ordered sets","volume":"28","author":"Faigle","year":"1979","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/0166-218X(90)90002-T_BIB6","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1145\/4221.4998","article-title":"On ordered languages and the optimization of linear functions by greedy algorithms","volume":"32","author":"Faigle","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90002-T_BIB7","article-title":"Submodular combinatorial structures","author":"Faigle","year":"1985"},{"key":"10.1016\/0166-218X(90)90002-T_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(90)90002-T_BIB9","series-title":"Convexity and Related Combinatorial Geometry","first-page":"113","article-title":"A perspective on abstract convexity: Classifying alignments by varieties","author":"Jamison-Waldner","year":"1982"},{"key":"10.1016\/0166-218X(90)90002-T_BIB10","first-page":"205","article-title":"Mathematical structures underlying greedy algorithms","volume":"117","author":"Korte","year":"1981"},{"key":"10.1016\/0166-218X(90)90002-T_BIB11","first-page":"221","article-title":"Greedoids: A structural framework for the greedy algorithm","author":"Korte","year":"1984"},{"issue":"2","key":"10.1016\/0166-218X(90)90002-T_BIB12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0605024","article-title":"Greedoids and linear objective functions","volume":"5","author":"Korte","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(90)90002-T_BIB13","first-page":"219","article-title":"Shelling structures, convexity, and a happy end","author":"Korte","year":"1984"},{"key":"10.1016\/0166-218X(90)90002-T_BIB14","article-title":"Polyhedral results for antimatroids","author":"Korte","year":"1985"},{"key":"10.1016\/0166-218X(90)90002-T_BIB15","first-page":"239","article-title":"Posets, matroids, and greedoids","author":"Korte","year":"1985"},{"key":"10.1016\/0166-218X(90)90002-T_BIB16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0166-218X(86)90049-1","article-title":"Homomorphisms and Ramsey properties of antimatroids","volume":"15","author":"Korte","year":"1986","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10.1016\/0166-218X(90)90002-T_BIB17","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","article-title":"Optimal sequencing of a single machine subject to precedence constraints","volume":"19","author":"Lawler","year":"1973","journal-title":"Management Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090002T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090002T?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:39Z","timestamp":1555135059000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090002T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0166218X9090002T"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90002-t","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}