{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T14:51:31Z","timestamp":1687186291809},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1016\/0167-6377(91)90061-s","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"211-219","source":"Crossref","is-referenced-by-count":2,"title":["Color constrained combinatorial optimization problems"],"prefix":"10.1016","volume":"10","author":[{"given":"Horst W.","family":"Hamacher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90061-S_BIB1","series-title":"Optimization","article-title":"Network Flows","volume":"Vol. 1","author":"Ahuja","year":"1989"},{"key":"10.1016\/0167-6377(91)90061-S_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02591988","article-title":"Two algorithms for weighted matroid intersection","volume":"36","author":"Brezovec","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/0167-6377(91)90061-S_BIB3","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF01589417","article-title":"A matroid algorithm and its application to the efficient solution of two optimization problems on graphs","volume":"42","author":"Brezovec","year":"1988","journal-title":"Mathematical Programming, Series B"},{"key":"10.1016\/0167-6377(91)90061-S_BIB4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A min-max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/0167-6377(91)90061-S_BIB5","series-title":"Proceedings of the 5-th ACM Symposium on Principles of Distributed Computing","article-title":"Optimal message routing without complete routing tables","author":"Frederickson","year":"1986"},{"key":"10.1016\/0167-6377(91)90061-S_BIB6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","article-title":"Efficient algorithms for a family of matroid intersection problems","volume":"5","author":"Gabow","year":"1984","journal-title":"Journal of Algorithms"},{"key":"10.1016\/0167-6377(91)90061-S_BIB7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0166-218X(84)90077-5","article-title":"Matroid intersection with the interleaving of two ordered sets","volume":"8","author":"Gusfield","year":"1984","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/0167-6377(91)90061-S_BIB8","first-page":"79","article-title":"K-best constrained bases of a matroid","volume":"34","author":"Leclerc","year":"1990","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0167-6377(91)90061-S_BIB9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(88)90149-5","article-title":"A multiply constrained matroid optimization problem","volume":"73","author":"Rendl","year":"1988","journal-title":"Discrete Mathematics"},{"key":"10.1016\/0167-6377(91)90061-S_BIB10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","article-title":"A strongly polynomial minimum cost circulation algorithm","volume":"5","author":"Tardos","year":"1985","journal-title":"Combinatorica"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190061S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190061S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:26:56Z","timestamp":1552901216000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779190061S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["016763779190061S"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90061-s","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}