메뉴 건너뛰기




Volumn 3, Issue 4, 2006, Pages 382-384

A note on a polynomial time solvable case of the quadratic assignment problem

Author keywords

Quadratic assignment problem; Solvability

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; POLYNOMIALS;

EID: 33748475350     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.04.001     Document Type: Article
Times cited : (8)

References (9)
  • 1
    • 33748461384 scopus 로고    scopus 로고
    • R.E. Burkard, E. Çela, V.M. Demidenko, N.N. Metelski, G.J. Woeginger, Perspectives of Easy and Hard Cases of the Quadratic Assignment Problems, SFB Report 104, Institute of Mathematics, Technical University Graz, Austria, 1997
  • 3
    • 0041763346 scopus 로고    scopus 로고
    • The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases, networks and matroids; sequencing and scheduling
    • Burkard R.E., Çela E., Rote G., and Woeginger G.J. The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases, networks and matroids; sequencing and scheduling. Math. Program. Ser. B 82 1-2 (1998) 125-158
    • (1998) Math. Program. Ser. B , vol.82 , Issue.1-2 , pp. 125-158
    • Burkard, R.E.1    Çela, E.2    Rote, G.3    Woeginger, G.J.4
  • 4
    • 0031997558 scopus 로고    scopus 로고
    • A solvable case of the quadratic assignment problem
    • Deineko V.G., and Woeginger G.J. A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22 (1998) 13-17
    • (1998) Oper. Res. Lett. , vol.22 , pp. 13-17
    • Deineko, V.G.1    Woeginger, G.J.2
  • 5
    • 33748465097 scopus 로고    scopus 로고
    • G. Erdoǧan, B. Tansel, Quadratic assignment problems that are solvable as linear assignment problems, working paper, Bilkent University, Department of Industrial Engineering 06800 Bilkent, Ankara, Turkey
  • 6
    • 0001805769 scopus 로고    scopus 로고
    • QAPLIB-a quadratic assignment problem library
    • Burkard R.E., Karisch St.E., and Rendl F. QAPLIB-a quadratic assignment problem library. J. Global Optim. 10 (1997) 391-403. http://www.opt.math.tu-graz.ac.at/qaplib/
    • (1997) J. Global Optim. , vol.10 , pp. 391-403
    • Burkard, R.E.1    Karisch, St.E.2    Rendl, F.3
  • 7
    • 33748450505 scopus 로고    scopus 로고
    • G. Erdoǧan, B. Tansel, A branch-and-cut algorithm for quadratic assignment problems based on linearizations. Comp. Oper. Res. (in press)
  • 8
    • 0002384937 scopus 로고
    • Assignment problems and the location of economic activities
    • Koopmans T.C., and Beckmann M. Assignment problems and the location of economic activities. Econometrica 25 (1957) 53-76
    • (1957) Econometrica , vol.25 , pp. 53-76
    • Koopmans, T.C.1    Beckmann, M.2


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