메뉴 건너뛰기




Volumn 119, Issue 2, 1999, Pages 314-325

Cluster based branching for the asymmetric traveling salesman problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; MATRIX ALGEBRA; SET THEORY;

EID: 0033355537     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00133-2     Document Type: Article
Times cited : (9)

References (14)
  • 1
    • 0019585395 scopus 로고
    • A restricted Lagrangean approach to the traveling salesman problem
    • Balas E., Christofides N. A restricted Lagrangean approach to the traveling salesman problem. Mathematical Programming. 21:1981;19-46.
    • (1981) Mathematical Programming , vol.21 , pp. 19-46
    • Balas, E.1    Christofides, N.2
  • 2
    • 0000185277 scopus 로고
    • A lift-and-project cutting plane algorithm for mixed 0-1 programs
    • Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming. 58:1993;295-324.
    • (1993) Mathematical Programming , vol.58 , pp. 295-324
    • Balas, E.1    Ceria, S.2    Cornuéjols, G.3
  • 3
    • 0000811707 scopus 로고
    • Pathology of traveling-salesman subtour-elimination algorithms
    • Bellmore M., Malone J.C. Pathology of traveling-salesman subtour-elimination algorithms. Operations Research. 19:1971;278-307.
    • (1971) Operations Research , vol.19 , pp. 278-307
    • Bellmore, M.1    Malone, J.C.2
  • 4
    • 0001345505 scopus 로고
    • Some new branching and bounding criteria for the asymmetric travelling salesman problem
    • Carpaneto G., Toth P. Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science. 26:1980;736-743.
    • (1980) Management Science , vol.26 , pp. 736-743
    • Carpaneto, G.1    Toth, P.2
  • 5
    • 0342481510 scopus 로고
    • Bounds for the travelling-salesman problem
    • Christofides N. Bounds for the travelling-salesman problem. Operations Research. 20:1972;1044-1056.
    • (1972) Operations Research , vol.20 , pp. 1044-1056
    • Christofides, N.1
  • 6
    • 0024626213 scopus 로고
    • An additive bounding procedure for combinatorial optimization problems
    • Fischetti M., Toth P. An additive bounding procedure for combinatorial optimization problems. Operations Research. 37:1989;319-328.
    • (1989) Operations Research , vol.37 , pp. 319-328
    • Fischetti, M.1    Toth, P.2
  • 7
    • 0026705963 scopus 로고
    • An additive bounding procedure for the asymmetric traveling salesman problem
    • Fischetti M., Toth P. An additive bounding procedure for the asymmetric traveling salesman problem. Mathematical Programming. 53:1992;173-197.
    • (1992) Mathematical Programming , vol.53 , pp. 173-197
    • Fischetti, M.1    Toth, P.2
  • 8
    • 0005422920 scopus 로고
    • An efficient algorithm for the min-sum arborescence problem on complete digraphs
    • Fischetti M., Toth P. An efficient algorithm for the min-sum arborescence problem on complete digraphs. ORSA Journal of Computing. 5:1993;426-434.
    • (1993) ORSA Journal of Computing , vol.5 , pp. 426-434
    • Fischetti, M.1    Toth, P.2
  • 9
    • 0343350934 scopus 로고
    • On partitioning the feasible set in a branch-and-bound algorithm for the asymmetric traveling-salesman problem
    • Garfinkel R.S. On partitioning the feasible set in a branch-and-bound algorithm for the asymmetric traveling-salesman problem. Operations Research. 21:1973;340-343.
    • (1973) Operations Research , vol.21 , pp. 340-343
    • Garfinkel, R.S.1
  • 11
    • 0001625702 scopus 로고
    • A patching algorithm for the nonsymmetric traveling-salesman problem
    • Karp R.M. A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM Journal of Computing. 8:1979;561-573.
    • (1979) SIAM Journal of Computing , vol.8 , pp. 561-573
    • Karp, R.M.1
  • 14
    • 0026225350 scopus 로고
    • TSPLIB - A Traveling Salesman Problem Library
    • Reinelt G. TSPLIB - A Traveling Salesman Problem Library. ORSA Journal of Computing. 3:1991;376-384.
    • (1991) ORSA Journal of Computing , vol.3 , pp. 376-384
    • Reinelt, G.1


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