{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:05:07Z","timestamp":1726412707112},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00186-012-0397-2","type":"journal-article","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T16:23:20Z","timestamp":1343751800000},"page":"223-237","source":"Crossref","is-referenced-by-count":7,"title":["Between a rock and a hard place: the two-to-one assignment problem"],"prefix":"10.1007","volume":"76","author":[{"given":"Dries","family":"Goossens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Polyakovskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,1]]},"reference":[{"key":"397_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(94)90199-6","volume":"49","author":"H-J Bandelt","year":"1994","unstructured":"Bandelt H-J, Crama Y, Spieksma FCR (1994) Approximation algorithms for multidimensional assignment problems with decomposable costs. Discret Appl Math 49: 25\u201350","journal-title":"Discret Appl Math"},{"key":"397_CR2","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/TCBB.2005.26","volume":"2","author":"P Biyani","year":"2005","unstructured":"Biyani P, Wu X, Sinha A (2005) Joint classification and pairing of human chromosomes. IEEE\/ACM Trans Comput Biol Bioinf 2: 102\u2013109","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"397_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(95)00031-L","volume":"65","author":"RE Burkard","year":"1996","unstructured":"Burkard RE, Rudolf R, Woeginger GJ (1996) Three-dimensional axial assignment problems with decomposable cost coefficients. Discret Appl Math 65: 123\u2013140","journal-title":"Discret Appl Math"},{"key":"397_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","volume":"60","author":"Y Crama","year":"1992","unstructured":"Crama Y, Spieksma FCR (1992) Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur J Oper Res 60: 273\u2013279","journal-title":"Eur J Oper Res"},{"key":"397_CR5","doi-asserted-by":"crossref","first-page":"608","DOI":"10.2514\/1.31299","volume":"45","author":"A Dutta","year":"2008","unstructured":"Dutta A, Tsiotras P (2008) Egalitarian peer-to-peer satellite refueling strategy. J Spacecr Rocket 45: 608\u2013618","journal-title":"J Spacecr Rocket"},{"key":"397_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0404007","volume":"4","author":"D Friesen","year":"1991","unstructured":"Friesen D, Langston M (1991) Analysis of a compound bin packing algorithm. SIAM J Discret Math 4: 61\u201379","journal-title":"SIAM J Discret Math"},{"key":"397_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s11590-009-0152-7","volume":"4","author":"D Goossens","year":"2010","unstructured":"Goossens D, Polyakovskiy S, Spieksma FCR, Woeginger GJ (2010) The approximability of three-dimensional assignment problems with bottleneck objective. Optim Lett 4: 7\u201316","journal-title":"Optim Lett"},{"key":"397_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"397_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann V (1991) Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf Process Lett 37: 27\u201335","journal-title":"Inf Process Lett"},{"key":"397_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/4235.850654","volume":"4","author":"G Magyar","year":"2000","unstructured":"Magyar G, Johnsson M, Nevalainen O (2000) An adaptive hybrid genetic algorithm for the three-matching problem. IEEE Trans Evol Comput 4: 135\u2013146","journal-title":"IEEE Trans Evol Comput"},{"key":"397_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E Petrank","year":"1994","unstructured":"Petrank E (1994) The hardness of approximation: gap location. Comput Complex 4: 133\u2013157","journal-title":"Comput Complex"},{"key":"397_CR12","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin"},{"key":"397_CR13","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/0377-2217(95)00003-8","volume":"91","author":"FCR Spieksma","year":"1996","unstructured":"Spieksma FCR, Woeginger GJ (1996) Geometric three-dimensional assignment problems. Eur J Oper Res 91: 611\u2013618","journal-title":"Eur J Oper Res"},{"key":"397_CR14","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0377-2217(02)00686-0","volume":"148","author":"T Urban","year":"2003","unstructured":"Urban T, Russel R (2003) Scheduling sport competitions on multiple venues. Eur J Oper Res 148: 302\u2013311","journal-title":"Eur J Oper Res"},{"key":"397_CR15","unstructured":"Wilson B (1963) Surf city. Liberty records"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0397-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0397-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0397-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:30Z","timestamp":1558607610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0397-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["397"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0397-2","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2012,8,1]]}}}