{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:57:44Z","timestamp":1773777464668,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6347,"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":[[1996,3]]},"DOI":"10.1016\/0166-218x(95)00036-q","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"207-221","source":"Crossref","is-referenced-by-count":11,"title":["Time-tables, polyhedra and the greedy algorithm"],"prefix":"10.1016","volume":"65","author":[{"given":"R.","family":"Euler","sequence":"first","affiliation":[]},{"given":"H.","family":"Le Verge","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00036-Q_BIB1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(80)90136-3","article-title":"Generalized latin rectangle II: embedding","volume":"31","author":"Andersen","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00036-Q_BIB2","first-page":"90","article-title":"Some comments on a note about time-tabling","volume":"16","author":"De Werra","year":"1978","journal-title":"INFOR"},{"key":"10.1016\/0166-218X(95)00036-Q_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0012-365X(86)90116-0","article-title":"On latin squares and the facial structure of related polytopes","volume":"62","author":"Euler","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00036-Q_BIB4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","article-title":"Facets of regular 0\u20131 polytopes","volume":"8","author":"Hammer","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(95)00036-Q_BIB5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(95)00036-Q_BIB6","first-page":"550","article-title":"A combinatorial theorem with an application to latin rectangles","volume":"2","author":"Ryser","year":"1951"},{"key":"10.1016\/0166-218X(95)00036-Q_BIB7","article-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500036Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500036Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T12:22:43Z","timestamp":1555590163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500036Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0166218X9500036Q"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00036-q","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}