{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:07:58Z","timestamp":1760645278692},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,10,13]],"date-time":"2006-10-13T00:00:00Z","timestamp":1160697600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2006,11,15]]},"DOI":"10.1007\/s10878-006-9009-5","type":"journal-article","created":{"date-parts":[[2006,10,12]],"date-time":"2006-10-12T14:13:40Z","timestamp":1160662420000},"page":"1-18","source":"Crossref","is-referenced-by-count":22,"title":["On the number of local minima for the multidimensional assignment problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Don A.","family":"Grundel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlo A.","family":"Krokhmal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A. S.","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,13]]},"reference":[{"key":"9009_CR1","doi-asserted-by":"crossref","unstructured":"Aiex R, Resende M, Pardalos PM, Toraldo G (2005) GRASP with path relinking for the three-index assignment problem. INFORMS J Comput 17(2):224\u2013247","DOI":"10.1287\/ijoc.1030.0059"},{"key":"9009_CR2","doi-asserted-by":"crossref","first-page":"5525","DOI":"10.1016\/S0362-546X(01)00656-3","volume":"47","author":"SM Andrijich","year":"2001","unstructured":"Andrijich SM, Caccetta L (2001) Solving the multisensor data association problem. Nonlinear Analysis 47:5525\u20135536.","journal-title":"Nonlinear Analysis"},{"key":"9009_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0304-3975(00)00239-5","volume":"263","author":"E Angel","year":"2001","unstructured":"Angel E, Zissimopoulos V (2001) On the landscape ruggedness of the quadratic assignment problem. Theor Comput Sci 263:159\u2013172","journal-title":"Theor Comput Sci"},{"key":"9009_CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.39.1.150","volume":"39","author":"E Balas","year":"1991","unstructured":"Balas E, Saltzman MJ (1991) An algorithm for the three-index assignment problem. Oper Res 39:150\u2013161","journal-title":"Oper Res"},{"key":"9009_CR5","doi-asserted-by":"crossref","unstructured":"Clemons W, Grundel D, Jeffcoat D (2003) Applying simulated annealing on the multidimensional assignment problem. In: Proceedings of the 2nd cooperative control and optimization conference","DOI":"10.1142\/9789812796592_0003"},{"key":"9009_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","journal-title":"Oper Res Lett"},{"key":"9009_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"9009_CR8","unstructured":"Festa P, Resende M (2001) GRASP: An annotated bibliography. In: Hansen P, Ribeiro CC (eds.) Essays and surveys on metaheuristics. Kluwer Academic Publishers, pp 325\u2013367"},{"key":"9009_CR9","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman and Company"},{"key":"9009_CR10","doi-asserted-by":"crossref","unstructured":"Gosavi A (2003) Simulation-based optimization: parametric optimization techniques and reinforcement learning. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-3766-0_9"},{"issue":"3","key":"9009_CR11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10589-005-3227-0","volume":"31","author":"DA Grundel","year":"2005","unstructured":"Grundel DA, Oliveira CAS, Pardalos PM, Pasiliao EL (2005) Asymptotic results for random multidimensional assignment problems. Comput Optim Appl 31(3):275\u2013293","journal-title":"Comput Optim Appl"},{"key":"9009_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"9009_CR13","volume-title":"Simulation modeling and analysis","author":"A Law","year":"1991","unstructured":"Law A, Kelton W (1991) Simulation modeling and analysis, 2nd edn. McGraw-Hill, Inc., New York","edition":"2"},{"key":"9009_CR14","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"issue":"6","key":"9009_CR15","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092","journal-title":"J Chem Phys"},{"key":"9009_CR16","doi-asserted-by":"crossref","unstructured":"Murphey R, Pardalos P, Pitsoulis L (1998) A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: DIMACS Series vol 40. American Mathematical Society, pp 277\u2013302.","DOI":"10.1090\/dimacs\/040\/17"},{"key":"9009_CR17","doi-asserted-by":"crossref","unstructured":"Olver FW (1997) Asymptotics and special functions. 2nd edn. AK Peters Ltd, Wellesley, MA","DOI":"10.1201\/9781439864548"},{"key":"9009_CR18","unstructured":"Palmer R (1991) Optimization on rugged landscapes. In: Perelson A, Kauffman S (eds), Molecular evolution on rugged ladscapes: proteins, RNA, and the immune system. Addison Wesley, Redwood City, CA, pp 3\u201325"},{"key":"9009_CR19","doi-asserted-by":"crossref","unstructured":"Pardalos PM, Pitsoulis L (eds.) (2000) Nonlinear assignment: problems, algorithms and applicationssignment: problems, algorithms and applications. Kluwer Academic Publishers, Dordrecht","DOI":"10.1007\/978-1-4757-3155-2"},{"key":"9009_CR20","doi-asserted-by":"crossref","unstructured":"Pasiliao EL (2003) Algorithms for multidimensional assignment problems. PhD. thesis, Department of Industrial and Systems Engineering, University of Florida","DOI":"10.1007\/978-1-4613-0219-3_21"},{"key":"9009_CR21","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W Pierskalla","year":"1968","unstructured":"Pierskalla W (1968) The multidimensional assignment problem. Operations Research 16:422\u2013431","journal-title":"Operations Research"},{"key":"9009_CR22","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/j.1538-7305.1962.tb02419.x","volume":"41","author":"D Slepian","year":"1962","unstructured":"Slepian D (1962) The one-sided barrier problem for gaussian noise. Bell Syst Techn J 41:463\u2013501","journal-title":"Bell Syst Techn J"},{"key":"9009_CR23","doi-asserted-by":"crossref","unstructured":"Stanley R (1986) Enumerative combinatorics, Wadsworth & Brooks, Belmont, CA","DOI":"10.1007\/978-1-4615-9763-6"},{"key":"9009_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9655-0","volume-title":"The multivariate normal distribution","author":"YL Tong","year":"1990","unstructured":"Tong YL (1990) The multivariate normal distribution. Springer Verlag, Berlin"},{"key":"9009_CR25","doi-asserted-by":"crossref","unstructured":"Veenman CJ, Hendriks EA, Reinders MJT (1998) A fast and robust point tracking algorithm. In: Proceedings of the fifth IEEE international conference on image processing Chicago, USA, pp 653\u2013657","DOI":"10.1109\/ICIP.1998.999051"},{"issue":"2","key":"9009_CR26","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00253805","volume":"1","author":"L Yong","year":"1992","unstructured":"Yong L, Pardalos PM (1992) Generating quadratic assignment test problems with known optimal permutations. Comput Optim Appl 1(2):163\u2013184","journal-title":"Comput Optim Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9009-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9009-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9009-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:10Z","timestamp":1559261890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9009-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,13]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,11,15]]}},"alternative-id":["9009"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9009-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,13]]}}}