{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T05:40:22Z","timestamp":1773812422410,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0167-6377(94)90001-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"59-71","source":"Crossref","is-referenced-by-count":37,"title":["Some properties of the fleet assignment problem"],"prefix":"10.1016","volume":"15","author":[{"given":"Zonghao","family":"Gu","sequence":"first","affiliation":[]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]},{"given":"Wang","family":"Yinhua","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90001-9_BIB1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/inte.19.4.20","article-title":"Applying integer linear programming to the fleet assignment problem","volume":"19","author":"Abara","year":"1989","journal-title":"Interfaces"},{"key":"10.1016\/0167-6377(94)90001-9_BIB2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1137\/0405039","article-title":"Covering graphs by cycles","volume":"5","author":"Fan","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0167-6377(94)90001-9_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(94)90001-9_BIB4","series-title":"Computational Optimization Center Report 92-04","article-title":"The Fleet Assignment Problem, Solving a Large Integer Programming Problem","author":"Hane","year":"1992"},{"key":"10.1016\/0167-6377(94)90001-9_BIB5","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/0210058","article-title":"Covering graphs by simple circuits","volume":"10","author":"Itai","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:52:28Z","timestamp":1552888348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0167637794900019"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90001-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}