A SUCCESSFUL ALGORITHM FOR SOLVING DIRECTED HAMILTONIAN PATH PROBLEMS

被引：8
|
作者：
THOMPSON, GL
SINGHAL, S
机构：
来源：
OPERATIONS RESEARCH LETTERS | 1984年 / 3卷 / 01期
关键词：
D O I：
10.1016/0167-6377(84)90069-5
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：35 / 42
页数：8
相关论文
共 50 条
  • [41] ALGORITHM FOR SOLVING FERMION PROBLEMS
    ECKMANN, JP
    GUENIN, M
    NUOVO CIMENTO DELLA SOCIETA ITALIANA DI FISICA B-GENERAL PHYSICS RELATIVITY ASTRONOMY AND MATHEMATICAL PHYSICS AND METHODS, 1973, 16 (01): : 85 - 92
  • [42] An algorithm for solving the obstacle problems
    Xue, L
    Cheng, XL
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2004, 48 (10-11) : 1651 - 1657
  • [43] Encoding Selection for Solving Hamiltonian Cycle Problems with ASP
    Liu, Liu
    Truszczynski, Miroslaw
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (306): : 302 - 308
  • [44] Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
    BangJensen, J
    ElHaddad, M
    Manoussakis, Y
    Przytycka, TM
    ALGORITHMICA, 1997, 17 (01) : 67 - 87
  • [45] Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs
    J. Bang-Jensen
    M. El Haddad
    Y. Manoussakis
    T. M. Przytycka
    Algorithmica, 1997, 17 : 67 - 87
  • [46] Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
    Bang-Jensen, J.
    El Haddad, M.
    Manoussakis, Y.
    Przytycka, T.M.
    Algorithmica (New York), 1997, 17 (01):
  • [47] Approximation algorithms for multiple terminal, Hamiltonian path problems
    Bae, Jungyun
    Rathinam, Sivakumar
    OPTIMIZATION LETTERS, 2012, 6 (01) : 69 - 85
  • [48] Approximation algorithms for multiple terminal, Hamiltonian path problems
    Jungyun Bae
    Sivakumar Rathinam
    Optimization Letters, 2012, 6 : 69 - 85
  • [49] Approximation Algorithms for the Directed Path Partition Problems
    Chen, Yong
    Chen, Zhi-Zhong
    Kennedy, Curtis
    Lin, Guohui
    Xu, Yao
    Zhang, An
    FRONTIERS OF ALGORITHMICS, IJTCS-FAW 2021, 2022, 12874 : 23 - 36
  • [50] An approximation algorithm for finding a long path in Hamiltonian graphs
    Vishwanathan, S
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 680 - 685
12345