A construction for directed in-out subgraphs of optimal size (Q4622626): Difference between revisions

@@ Property / arXiv ID @@
+.03075
@@ Property / arXiv ID: 1702.03075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem
+Normal rank
@@ Property / cites work @@
+A model for warehouse order picking
@@ Property / cites work: A model for warehouse order picking / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
+Normal rank
@@ Property / cites work @@
+Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
+Normal rank
@@ Property / cites work @@
+An effective implementation of the Lin-Kernighan traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+Q5578578
@@ Property / cites work: Q5578578 / rank @@
+Normal rank
@@ Property / cites work @@
+Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
+Normal rank
@@ Property / cites work @@
+An Efficient Transformation Of The Generalized Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q5613007
@@ Property / cites work: Q5613007 / rank @@
+Normal rank