{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:16:05Z","timestamp":1773656165062,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0166-218x(96)00128-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"239-253","source":"Crossref","is-referenced-by-count":20,"title":["Approximation algorithms for multi-index transportation problems with decomposable costs"],"prefix":"10.1016","volume":"76","author":[{"given":"M.","family":"Queyranne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.C.R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00128-X_BIB1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.39.1.150","article-title":"An algorithm for the three-index assignment problem","volume":"39","author":"Balas","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00128-X_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(94)90199-6","article-title":"Approximation algorithms for multidimensional assignment problems with decomposable costs","volume":"49","author":"Bandelt","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00128-X_BIB3","first-page":"721","article-title":"A multidimensional transportation problem","volume":"9","author":"Corban","year":"1964","journal-title":"Revue Roumaine Math. Pures Appliqu\u00e9es"},{"key":"10.1016\/S0166-218X(96)00128-X_BIB4","first-page":"57","article-title":"On a three-dimensional transportation problem","volume":"11","author":"Corban","year":"1966","journal-title":"Revue Roumaine Math. Pures Appliqu\u00e9es"},{"key":"10.1016\/S0166-218X(96)00128-X_BIB5","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":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00128-X_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\/S0166-218X(96)00128-X_BIB7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","article-title":"Efficient methods for multiple sequence alignment with guaranteed error bounds","volume":"55","author":"Gusfield","year":"1993","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0166-218X(96)00128-X_BIB8","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\/S0166-218X(96)00128-X_BIB9","series-title":"Integer and Combinatorial Optimalization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(96)00128-X_BIB10","series-title":"Proceedings of the 20th ACM Symposium on the Theory of Computing","first-page":"377","article-title":"A faster strongly polynomial minimum cost flow algorithm","author":"Orlin","year":"1988"},{"key":"10.1016\/S0166-218X(96)00128-X_BIB11","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1137\/0152101","article-title":"Multiple alignment, communication cost and graph matching","volume":"52","author":"Pevzner","year":"1992","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(96)00128-X_BIB12","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","article-title":"The multi-dimensional assignment problem","volume":"16","author":"Pierskalla","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00128-X_BIB13","series-title":"Proceedings of the 3rd IPCO Conference","first-page":"385","article-title":"A general class of greedily solvable linear programs","author":"Queyranne","year":"1993"},{"key":"10.1016\/S0166-218X(96)00128-X_BIB14","series-title":"Proceedings of the 2nd Symposium in Linear Programming","first-page":"615","article-title":"Distribution of a product by several properties","author":"Schell","year":"1955"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600128X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600128X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:00Z","timestamp":1556130540000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9600128X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0166218X9600128X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00128-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}