{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:31Z","timestamp":1742913811665,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":41,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_415","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2413-2419","source":"Crossref","is-referenced-by-count":2,"title":["Multi-index Transportation Problems"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Queyranne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"415_CR1_415","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1002\/nav.3800250411","volume":"25","author":"D. Bammi","year":"1978","unstructured":"Bammi D (1978) A\u00a0generalized-indices transportation problem. Naval Res Logist Quart 25:697\u2013710","journal-title":"Naval Res. Logist. Quart."},{"key":"415_CR2_415","doi-asserted-by":"publisher","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. Discrete Appl Math 49:25\u201350","journal-title":"Discrete Appl. Math."},{"key":"415_CR3_415","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)E0121-E","volume":"58","author":"W.W. Bein","year":"1995","unstructured":"Bein WW, Brucker P, Park JK, Pathak PK (1995) A\u00a0Monge property for the d-dimensional transportation problem. Discrete Appl Math 58:97\u2013109","journal-title":"Discrete Appl. Math."},{"key":"415_CR4_415","first-page":"721","volume":"IX","author":"A. Corban","year":"1964","unstructured":"Corban A (1964) A\u00a0multidimensional transportation problem. Rev Roumaine Math Pures et Appl IX:721\u2013735","journal-title":"Rev. Roumaine Math. Pures et Appl."},{"key":"415_CR5_415","first-page":"57","volume":"XI","author":"A. Corban","year":"1966","unstructured":"Corban A (1966) On a\u00a0three-dimensional transportation problem. Rev Roumaine Math Pures et Appl XI:57\u201375","journal-title":"Rev. Roumaine Math. Pures et Appl."},{"key":"415_CR6_415","doi-asserted-by":"publisher","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. Europ J Oper Res 60:273\u2013279","journal-title":"Europ. J. Oper. Res."},{"key":"415_CR7_415","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(95)00036-Q","volume":"65","author":"R. Euler","year":"1996","unstructured":"Euler R, Le Verge H (1996) Time-tables, polyhedra and the greedy algorithm. Discrete Appl Math 65:207\u2013222","journal-title":"Discrete Appl. Math."},{"key":"415_CR8_415","first-page":"195","volume":"72","author":"U. Faigle","year":"1996","unstructured":"Faigle U, Kern W (1996) Submodular linear programs on forests. Math Program 72:195\u2013206","journal-title":"Math. Program."},{"key":"415_CR9_415","doi-asserted-by":"crossref","unstructured":"Fortin D, Tusera A (1994) Routing in meshes using linear assignment. In: Bachem A, Derigs U, J\u00fcnger M, Schrader R (eds) Operation Research 93, pp 169\u2013171","DOI":"10.1007\/978-3-642-46955-8_44"},{"key":"415_CR10_415","doi-asserted-by":"publisher","first-page":"989","DOI":"10.2307\/2581852","volume":"32","author":"A.M. Frieze","year":"1981","unstructured":"Frieze AM, Yadegar J (1981) An algorithm for solving 3-dimensional assignment problems with application to scheduling\n\t    a\u00a0teaching practice. J\u00a0Oper Res Soc 32:989\u2013995","journal-title":"J. Oper. Res. Soc."},{"key":"415_CR11_415","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/0377-2217(94)90253-4","volume":"73","author":"S. Geetha","year":"1994","unstructured":"Geetha S, Vartak MN (1994) The three-dimensional bottleneck assignment problem with capacity constraints. Europ J Oper Res 73:562\u2013568","journal-title":"Europ. J. Oper. Res."},{"key":"415_CR12_415","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/07408178708975366","volume":"8","author":"K.C. Gilbert","year":"1987","unstructured":"Gilbert KC, Hofstra RB (1987) An algorithm for a\u00a0class of three-dimensional assignment problems arising in scheduling applications. IIE Trans 8:29\u201333","journal-title":"IIE Trans."},{"key":"415_CR13_415","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1287\/opre.10.4.448","volume":"10","author":"K.B. Haley","year":"1962","unstructured":"Haley KB (1962) The solid transportation problem. Oper Res 10:448\u2013463","journal-title":"Oper. Res."},{"key":"415_CR14_415","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/opre.11.3.368","volume":"11","author":"K.B. Haley","year":"1963","unstructured":"Haley KB (1963) The multi-index problem. Oper Res 11:368\u2013379","journal-title":"Oper. Res."},{"key":"415_CR15_415","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01917187","volume":"16","author":"W. Junginger","year":"1972","unstructured":"Junginger W (1972) Zur\u00fcckf\u00fchrung des Stundenplanproblems auf einen dreidimensionales Transportproblem. Z Oper Res 16:11\u201325","journal-title":"Z. Oper. Res."},{"key":"415_CR16_415","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0377-2217(93)90223-A","volume":"66","author":"W. Junginger","year":"1993","unstructured":"Junginger W (1993) On representatives of multi-index transportation problems. Europ J Oper Res 66:353\u2013371","journal-title":"Europ. J. Oper. Res."},{"key":"415_CR17_415","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum, New York, pp 85\u2013103"},{"key":"415_CR18_415","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF00229300","volume":"8","author":"D. Magos","year":"1996","unstructured":"Magos D (1996) Tabu search for the planar three-index assignment problem. J\u00a0Global Optim 8:35\u201348","journal-title":"J. Global Optim."},{"key":"415_CR19_415","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0377-2217(94)90034-5","volume":"77","author":"D. Magos","year":"1994","unstructured":"Magos D, Miliotis P (1994) An algorithm for the planar three-index assignment problem. Europ J Oper Res 77:141\u2013153","journal-title":"Europ. J. Oper. Res."},{"key":"415_CR20_415","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0377-2217(97)00083-0","volume":"105\/3","author":"T. Mavridou","year":"1998","unstructured":"Mavridou T, Pardalos PM, Pitsoulis L, Resende MGC (1998) A\u00a0GRASP for the biquadratic assignment problem. Europ J Oper Res 105\/3:613\u2013621","journal-title":"Europ. J. Oper. Res."},{"key":"415_CR21_415","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/0305-0548(95)00073-9","volume":"23","author":"J.L. Miller","year":"1996","unstructured":"Miller JL, Frank LS (1996) A\u00a0binary-rounding heuristic for multi-period variable-task duration assignment problems. Comput Oper Res 23:819\u2013828","journal-title":"Computers Oper. Res."},{"key":"415_CR22_415","first-page":"494","volume":"58","author":"T. Motzkin","year":"1952","unstructured":"Motzkin T (1952) The multi-index transportation problem. Bull Amer Math Soc 58:494","journal-title":"Bull. Amer. Math. Soc."},{"key":"415_CR23_415","first-page":"277","volume-title":"DIMACS","author":"R. Murphey","year":"1998","unstructured":"Murphey R, Pardalos PM, Pitsoulis L (1998) A\u00a0GRASP for the multitarget multisensor tracking problem. In: DIMACS, vol\u00a040. Amer Math Soc, Providence, pp 277\u2013302"},{"key":"415_CR24_415","first-page":"159","volume":"106","author":"R. Murphey","year":"1998","unstructured":"Murphey R, Pardalos PM, Pitsoulis L (1998) A\u00a0parallel GRASP for the data association multidimensional assignment problem. In: IMA Vol Math Appl, vol\u00a0106. Springer, Berlin, pp 159\u2013180","journal-title":"IMA vol\u00a0Math. Appl."},{"key":"415_CR25_415","unstructured":"Pattipatti KR, Deb S, Bar-Shalom Y, Washburn RB Jr (1990) Passive multisensor data association using a\u00a0new relaxation algorithm. In: Bar-Shalom Y (ed) Multitarget-multisensor tracking: Advances and applications, p 111"},{"key":"415_CR26_415","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/9.121621","volume":"37","author":"K.R. Pattipatti","year":"1992","unstructured":"Pattipatti KR, Deb S, Bar\u2014Shalom Y, Washburn RB Jr (1992) A\u00a0new relaxation algorithm passive sensor data association. IEEE Trans Autom Control 37:198\u2013213","journal-title":"IEEE Trans. Autom. Control"},{"key":"415_CR27_415","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W.P. Pierskalla","year":"1968","unstructured":"Pierskalla WP (1968) The multidimensional assignment problem. Oper Res 16:422\u2013431","journal-title":"Oper. Res."},{"key":"415_CR28_415","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01299390","volume":"3","author":"A.B. Poore","year":"1994","unstructured":"Poore AB (1994) Multidimensional assignment formulation of data-association problems arising from multitarget and multisensor tracking. Comput Optim Appl 3:27\u201357","journal-title":"Comput. Optim. Appl."},{"key":"415_CR29_415","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/0803027","volume":"3","author":"A.B. Poore","year":"1993","unstructured":"Poore AB, Rijavec N (1993) A\u00a0Lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking. SIAM J Optim 3:544\u2013563","journal-title":"SIAM J. Optim."},{"key":"415_CR30_415","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(96)00128-X","volume":"76","author":"M. Queyranne","year":"1997","unstructured":"Queyranne M, Spieksma FCR (1997) Approximation algorithms for multi-index transportation problems with decomposable costs. Discrete Appl Math 76:239\u2013253","journal-title":"Discrete Appl. Math."},{"key":"415_CR31_415","unstructured":"Queyranne M, Spieksma FCR, Tardella F (1993) A\u00a0general class of greedily solvable linear programs. In: Rinaldi G, Wolsey L (eds) Proc Third IPCO Conf (Integer Programming and Combinatorial Optimization), pp 385\u2013399"},{"issue":"4","key":"415_CR32_415","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1287\/moor.23.4.892","volume":"23","author":"M Queyranne","year":"1998","unstructured":"Queyranne M, Spieksma FCR, Tardella F (1998) A\u00a0general class of greedily solvable linear programs. Math Oper Res 23(4):892\u2013908","journal-title":"Math Oper Res"},{"key":"415_CR33_415","first-page":"459","volume":"41","author":"C.A. Rautman","year":"1993","unstructured":"Rautman CA, Reid RA, Ryder EE (1993) Scheduling the disposal of nuclear waste material in a\u00a0geologic repository using the transportation model. Oper Res 41:459\u2013469","journal-title":"Oper. Res."},{"key":"415_CR34_415","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00940537","volume":"66","author":"D. Romero","year":"1990","unstructured":"Romero D (1990) Easy transportation-like problems on K-dimensional arrays. J\u00a0Optim Th Appl 66:137\u2013147","journal-title":"J. Optim. Th. Appl."},{"key":"415_CR35_415","first-page":"615","volume-title":"Second Symposium in Linear Programming 2","author":"E. Schell","year":"1955","unstructured":"Schell E (1955) Distribution of a\u00a0product by several properties. In: Directorate of Management Analysis (ed) Second Symposium in Linear Programming 2. DCS\/Comptroller HQ, US Air Force, Washington DC, pp 615\u2013642"},{"key":"415_CR36_415","first-page":"121","volume":"1","author":"J.K. Sharma","year":"1977","unstructured":"Sharma JK, Sharup K (1977) Time-minimizing multidimensional transportation problem. J\u00a0Eng Production 1:121\u2013129","journal-title":"J. Engin. Production"},{"key":"415_CR37_415","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/0377-2217(95)00003-8","volume":"91","author":"F.C.R. Spieksma","year":"1996","unstructured":"Spieksma FCR, Woeginger GJ (1996) Geometric three-dimensional assignment problems. Europ J Oper Res 91:611\u2013618","journal-title":"Europ. J. Oper. Res."},{"key":"415_CR38_415","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0377-2217(95)00247-2","volume":"95","author":"G. Tzeng","year":"1996","unstructured":"Tzeng G, Teodorovi\u0107 D, Hwang M (1996) Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower. Europ J Oper Res 95:62\u201372","journal-title":"Europ. J. Oper. Res."},{"key":"415_CR39_415","first-page":"181","volume":"3","author":"M. Vlach","year":"1967","unstructured":"Vlach M (1967) Branch and bound method for the three-index assignment problem. Ekonomicko\u2013Matematicky Obzor 3:181\u2013191","journal-title":"Ekonomicko\u2014Matematicky Obzor"},{"key":"415_CR40_415","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(86)90069-7","volume":"13","author":"M. Vlach","year":"1986","unstructured":"Vlach M (1986) Conditions for the existence of solutions of the three-dimensional planar transportation problem. Discrete Appl Math 13:61\u201378","journal-title":"Discrete Appl. Math."},{"key":"415_CR41_415","volume-title":"Polytopes, graphs and optimization","author":"V.A. Yemelichev","year":"1984","unstructured":"Yemelichev VA, Kovalev MM, Kratsov MK (1984) Polytopes, graphs and optimization. Cambridge Univ Press, Cambridge"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:48:57Z","timestamp":1720691337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_415"}},"subtitle":["MITP"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_415","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}