{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:21:03Z","timestamp":1773656463744,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7078,"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":[[1994,3]]},"DOI":"10.1016\/0166-218x(94)90199-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"25-50","source":"Crossref","is-referenced-by-count":65,"title":["Approximation algorithms for multi-dimensional assignment problems with decomposable costs"],"prefix":"10.1016","volume":"49","author":[{"given":"Hans-J\u00fcrgen","family":"Bandelt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Crama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C.R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90199-6_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(89)90014-0","article-title":"Facets of the three-index assignment polytope","volume":"23","author":"Balas","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90199-6_BIB2","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF03543080","article-title":"Throughput rate optimization in the automated assembly of printed circuits boards","volume":"26","author":"Crama","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0166-218X(94)90199-6_BIB3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","article-title":"Approximation algorithms for three-dimensional assignment problems with triangle inequalities","volume":"60","author":"Crama","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90199-6_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230200205","article-title":"A class of bounded approximation algorithms for graph partitioning","volume":"20","author":"Feo","year":"1990","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)90199-6_BIB5","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01585532","article-title":"A bilinear programming formulation of the 3-dimensional assignment problem","volume":"7","author":"Frieze","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)90199-6_BIB6","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1057\/jors.1981.207","article-title":"An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice","volume":"32","author":"Frieze","year":"1981","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0166-218X(94)90199-6_BIB7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1287\/opre.11.3.368","article-title":"The multi-index problem","volume":"11","author":"Haley","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90199-6_BIB8","first-page":"327","article-title":"A primal-dual algorithm for the three-dimensional assignment problem","volume":"15","author":"Hansen","year":"1973","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(94)90199-6_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(94)90199-6_BIB10","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/0166-218X(94)90199-6_BIB11","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(94)90199-6_BIB12","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","article-title":"The multidimensional assignment problem","volume":"16","author":"Pierskalla","year":"1968","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901996?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901996?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:00:16Z","timestamp":1580882416000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0166218X94901996"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90199-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}