메뉴 건너뛰기




Volumn 32, Issue 4, 1998, Pages 370-379

Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; RAILROAD YARDS AND TERMINALS; RESOURCE ALLOCATION; SCHEDULING; VALUE ENGINEERING;

EID: 0032205156     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.32.4.370     Document Type: Article
Times cited : (90)

References (13)
  • 1
    • 21144457234 scopus 로고
    • An Algorithm for Solving Traveling Salesman and Related Network Optimization Problems
    • St Louis
    • F. BOCK, "An Algorithm for Solving Traveling Salesman and Related Network Optimization Problems," presented in ORSA congress, St Louis, 1958.
    • (1958) ORSA Congress
    • Bock, F.1
  • 5
    • 0001237146 scopus 로고
    • A Method for Solving Traveling Salesman Problems
    • G. A. CROES, "A Method for Solving Traveling Salesman Problems," Operations Research 6, 791-812 (1958).
    • (1958) Operations Research , vol.6 , pp. 791-812
    • Croes, G.A.1
  • 11
    • 84908780328 scopus 로고
    • Computer Solutions to the Traveling Salesman Problem
    • S. LIN, "Computer Solutions to the Traveling Salesman Problem," Bell System Technical Journal 44, 2245-2269 (1965).
    • (1965) Bell System Technical Journal , vol.44 , pp. 2245-2269
    • Lin, S.1
  • 12
    • 0015604699 scopus 로고
    • An Effective Heuristic for the Traveling Salesman Problem
    • S. LIN, AND B. KERNIGHAN, "An Effective Heuristic for the Traveling Salesman Problem," Operations Research 21, 498-516 (1973).
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.2


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