메뉴 건너뛰기




Volumn 29, Issue 1, 1999, Pages 327-335

Swapping problem on a line

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER WORKSTATIONS; OPTIMIZATION; PROBLEM SOLVING;

EID: 0343168153     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797323108     Document Type: Article
Times cited : (21)

References (11)
  • 1
    • 0041610509 scopus 로고
    • The swapping problem
    • S. ANILY AND R. HASSIN (1992), The swapping problem, Networks, 22, pp. 419-433.
    • (1992) Networks , vol.22 , pp. 419-433
    • Anily, S.1    Hassin, R.2
  • 3
    • 0024089661 scopus 로고
    • Efficient solutions to some transportation problems with applications to minimizing robot arm travel
    • M. J. ATALLAH AND S. R. KOSARAJU (1988), Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM J. Comput., 17, pp. 849-869.
    • (1988) SIAM J. Comput. , vol.17 , pp. 849-869
    • Atallah, M.J.1    Kosaraju, S.R.2
  • 4
    • 0342845136 scopus 로고
    • An algorithm to construct a minimum directed spanning tree in a directed network
    • Gordon and Breach, New York
    • F. BOCK (1971), An algorithm to construct a minimum directed spanning tree in a directed network, in Developments in Operations Research. Gordon and Breach, New York, pp. 29-44.
    • (1971) Developments in Operations Research , pp. 29-44
    • Bock, F.1
  • 5
    • 0000666661 scopus 로고
    • On the shortest arborescence of a directed graph
    • Y. J. CHU AND T. H. LIU (1965), On the shortest arborescence of a directed graph, Sci. Sinica, 14, pp. 1396-1400.
    • (1965) Sci. Sinica , vol.14 , pp. 1396-1400
    • Chu, Y.J.1    Liu, T.H.2
  • 7
    • 0027541718 scopus 로고
    • A note on the complexity of a simple transportation problem
    • G. N. FREDERICKSON (1993), A note on the complexity of a simple transportation problem, SIAM J. Comput, 22, pp. 57-61.
    • (1993) SIAM J. Comput , vol.22 , pp. 57-61
    • Frederickson, G.N.1
  • 8
    • 0000149127 scopus 로고
    • Preemptive ensemble motion planning on a tree
    • G. N. FREDERICKSON AND D. J. GUAN (1992), Preemptive ensemble motion planning on a tree, SIAM J. Comput., 21, pp. 1130-1152.
    • (1992) SIAM J. Comput. , vol.21 , pp. 1130-1152
    • Frederickson, G.N.1    Guan, D.J.2
  • 9
    • 38249002010 scopus 로고
    • Nonpreemptive ensemble motion planning on a tree
    • G. N. FREDERICKSON AND D. J. GUAN (1993), Nonpreemptive ensemble motion planning on a tree, J. Algorithms, 15, pp. 29-60.
    • (1993) J. Algorithms , vol.15 , pp. 29-60
    • Frederickson, G.N.1    Guan, D.J.2
  • 10
    • 0001548320 scopus 로고
    • Approximation algorithms for some routing problems
    • G. N. FREDERICKSON, M. S. HECHT, AND C. E. KIM (1978), Approximation algorithms for some routing problems, SIAM J. Comput., 7, pp. 178-193.
    • (1978) SIAM J. Comput. , vol.7 , pp. 178-193
    • Frederickson, G.N.1    Hecht, M.S.2    Kim, C.E.3
  • 11
    • 0041632634 scopus 로고
    • Performance guarantees for heuristics
    • E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, eds., John Wiley, New York, Chapter 5
    • D. S. JOHNSON AND C. H. PAPADIMITRIOU (1985), Performance guarantees for heuristics, in The Traveling Salesman Problem, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, eds., John Wiley, New York, Chapter 5, pp. 145-180.
    • (1985) The Traveling Salesman Problem , pp. 145-180
    • Johnson, D.S.1    Papadimitriou, C.H.2


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