A successful algorithm for solving directed Hamiltonian path problems (Q788642): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(84)90069-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2039484262
@@ Property / OpenAlex ID: W2039484262 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Large-scale Travelling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
+Normal rank
@@ Property / cites work @@
+Q3214706
@@ Property / cites work: Q3214706 / rank @@
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
+Normal rank
@@ Property / cites work @@
+Q4145160
@@ Property / cites work: Q4145160 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Tours and Paths in Rectangular Lattice Graphs
+Normal rank