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 条
  • [21] An Approximate Algorithm for Solving Shortest Path Problems for Mobile Robots or Driver Assistance
    Li, Fajie
    Klette, Reinhard
    Morales, Sandino
    2009 IEEE INTELLIGENT VEHICLES SYMPOSIUM, VOLS 1 AND 2, 2009, : 42 - 47
  • [22] Composite path algebras for solving path problems in graphs
    Manger, R
    ARS COMBINATORIA, 2006, 78 : 137 - 150
  • [23] An Algorithm to Embed Hamiltonian Path into ECQ Network
    Zhou, Dongfang
    Fan, Jianxi
    Lin, Cheng-Kuan
    Wang, Yan
    Cheng, Baolei
    2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 1026 - 1030
  • [24] INCLUSION AND EXCLUSION ALGORITHM FOR THE HAMILTONIAN PATH PROBLEM
    BAX, ET
    INFORMATION PROCESSING LETTERS, 1993, 47 (04) : 203 - 207
  • [25] Parallel backtracking algorithm for hamiltonian path search
    Grondzak, Karol
    Martincova, Penka
    Communications - Scientific Letters of the University of Žilina, 2009, 11 (03): : 15 - 19
  • [26] FAST ALGORITHMS FOR SOLVING PATH PROBLEMS
    TARJAN, RE
    JOURNAL OF THE ACM, 1981, 28 (03) : 594 - 614
  • [27] On solving dynamic shortest path problems
    Nasrabadi, Ebrahim
    Hashemi, S. Mehdi
    20TH INTERNATIONAL CONFERENCE, EURO MINI CONFERENCE CONTINUOUS OPTIMIZATION AND KNOWLEDGE-BASED TECHNOLOGIES, EUROPT'2008, 2008, : 48 - 53
  • [28] Solving path problems on a network of computers
    Manger, Robert
    Informatica (Ljubljana), 2002, 26 (01) : 91 - 100
  • [29] A library of subroutines for solving path problems
    Manger, R
    KOI'96 - 6TH INTERNATIONAL CONFERENCE ON OPERATIONAL RESEARCH, PROCEEDINGS, 1996, : 49 - 56
  • [30] A LOWER BOUND FOR THE SHORTEST HAMILTONIAN PATH IN DIRECTED-GRAPHS
    MACULAN, N
    SALLES, JJC
    OR SPEKTRUM, 1991, 13 (02) : 99 - 102
12345