{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:49:04Z","timestamp":1761580144168},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0377-2217(03)00205-4","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T23:44:52Z","timestamp":1059695092000},"page":"322-331","source":"Crossref","is-referenced-by-count":24,"title":["Solving the k-cardinality assignment problem by transformation"],"prefix":"10.1016","volume":"157","author":[{"given":"A.","family":"Volgenant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00205-4_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0167-6377(83)90045-7","article-title":"Traffic assignment in communication satellites","volume":"2","author":"Balas","year":"1983","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0166-218X(00)00301-2","article-title":"Efficient algorithms and codes for k-cardinality assignment problems","volume":"110","author":"Dell'Amico","year":"2001","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(97)00120-0","article-title":"The k-cardinality assignment problem","volume":"76","author":"Dell'Amico","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","article-title":"Algorithms and codes for dense assignment problems: The state of the art","volume":"100","author":"Dell'Amico","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1023\/A:1009881326671","article-title":"Generalized Steiner problems and other variants","volume":"4","author":"Dror","year":"2000","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB6","doi-asserted-by":"crossref","unstructured":"Duin, C.W., Volgenant, A., Voss, S., In press. Solving group Steiner problems as Steiner problems. European Journal of Operational Research","DOI":"10.1016\/S0377-2217(02)00707-5"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1287\/opre.47.3.449","article-title":"The assignment problem with seniority and job priority constraints","volume":"47","author":"Garon","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB8","first-page":"155","article-title":"Algebraic \u2211k-assignment problems","volume":"10","author":"Grygiel","year":"1981","journal-title":"Control and Cybernetics"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB9","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R","article-title":"An improved approximation scheme for the group Steiner problem","volume":"37","author":"Helvig","year":"2001","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","article-title":"A shortest augmenting path algorithm for dense and sparse linear assignment problems","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0377-2217(98)00361-0","article-title":"Linear assignment procedures","volume":"116","author":"Jonker","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB12","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.40.1.178","article-title":"A shortest augmenting path algorithm for the semi-assignment problem","volume":"40","author":"Kennington","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB13","unstructured":"Knuth, D.E., 1981. Seminumerical Algorithms. The Art of Computer Programming, vol. 2 (3.2\u20133.3), Reading, MA"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/opre.24.1.190","article-title":"A hard assignment problem","volume":"24","author":"Machol","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(99)00052-9","article-title":"Constrained weighted matchings and edge coverings in graphs","volume":"92","author":"Plesn\u0131\u0301k","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(03)00205-4_BIB16","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1057\/jors.1994.99","article-title":"An overview of scheduling problems arising in satellite communications","volume":"45","author":"Prins","year":"1994","journal-title":"Journal of the Operational Research Society"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T07:54:44Z","timestamp":1552809284000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0377221703002054"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00205-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}