메뉴 건너뛰기




Volumn 13, Issue 1, 2007, Pages 1-18

On the number of local minima for the multidimensional assignment problem

Author keywords

Combinatorial optimization; Local minima; Multidimensional assignment problem; Neighborhood search; Random costs

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; OPTIMIZATION; STRATEGIC PLANNING; TRACKING (POSITION);

EID: 33751120174     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9009-5     Document Type: Article
Times cited : (20)

References (26)
  • 1
    • 21244472297 scopus 로고    scopus 로고
    • GRASP with path relinking for the three-index assignment problem
    • Alex R, Resende M, Pardalos PM, Toraldo G (2005) GRASP with path relinking for the three-index assignment problem. INFORMS J Comput 17(2):224-247
    • (2005) INFORMS J Comput , vol.17 , Issue.2 , pp. 224-247
    • Alex, R.1    Resende, M.2    Pardalos, P.M.3    Toraldo, G.4
  • 2
    • 0035422176 scopus 로고    scopus 로고
    • Solving the multisensor data association problem
    • Andrijich SM, Caccetta L (2001) Solving the multisensor data association problem. Nonlinear Analysis 47:5525-5536.
    • (2001) Nonlinear Analysis , vol.47 , pp. 5525-5536
    • Andrijich, S.M.1    Caccetta, L.2
  • 3
    • 0034925685 scopus 로고    scopus 로고
    • On the landscape ruggedness of the quadratic assignment problem
    • Angel E, Zissimopoulos V (2001) On the landscape ruggedness of the quadratic assignment problem. Theor Comput Sci 263:159-172
    • (2001) Theor Comput Sci , vol.263 , pp. 159-172
    • Angel, E.1    Zissimopoulos, V.2
  • 4
    • 0000667028 scopus 로고
    • An algorithm for the three-index assignment problem
    • Balas E, Saltzman MJ (1991) An algorithm for the three-index assignment problem. Oper Res 39:150-161
    • (1991) Oper Res , vol.39 , pp. 150-161
    • Balas, E.1    Saltzman, M.J.2
  • 6
    • 0024640804 scopus 로고
    • A probabilistic heuristic for a computationally difficult set covering problem
    • Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67-71
    • (1989) Oper Res Lett , vol.8 , pp. 67-71
    • Feo, T.A.1    Resende, M.G.C.2
  • 7
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109-133
    • (1995) J Glob Optim , vol.6 , pp. 109-133
    • Feo, T.A.1    Resende, M.G.C.2
  • 8
    • 0002447404 scopus 로고    scopus 로고
    • GRASP: An annotated bibliography
    • Hansen P, Ribeiro CC (eds.). Kluwer Academic Publishers
    • 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-367
    • (2001) Essays and Surveys on Metaheuristics , pp. 325-367
    • Festa, P.1    Resende, M.2
  • 14
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling salesman problem
    • Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498-516
    • (1973) Oper Res , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 16
    • 0000151029 scopus 로고    scopus 로고
    • A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem
    • American Mathematical Society
    • 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-302.
    • (1998) DIMACS Series Vol 40 , pp. 277-302
    • Murphey, R.1    Pardalos, P.2    Pitsoulis, L.3
  • 21
    • 0000937639 scopus 로고
    • The multidimensional assignment problem
    • Pierskalla W (1968) The multidimensional assignment problem. Operations Research 16:422-431
    • (1968) Operations Research , vol.16 , pp. 422-431
    • Pierskalla, W.1
  • 22
    • 84944485006 scopus 로고
    • The one-sided barrier problem for gaussian noise
    • Slepian D (1962) The one-sided barrier problem for gaussian noise. Bell Syst Techn J 41:463-501
    • (1962) Bell Syst Techn J , vol.41 , pp. 463-501
    • Slepian, D.1
  • 26
    • 0000466667 scopus 로고
    • Generating quadratic assignment test problems with known optimal permutations
    • Yong L, Pardalos PM (1992) Generating quadratic assignment test problems with known optimal permutations. Comput Optim Appl 1(2):163-184
    • (1992) Comput Optim Appl , vol.1 , Issue.2 , pp. 163-184
    • Yong, L.1    Pardalos, P.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.