Locating a cycle in a transportation or a telecommunications network (Q3593375): Difference between revisions

@@ Property / DOI @@
-.1002/net.20170
@@ Property / DOI: 10.1002/net.20170 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4461916
@@ Property / cites work: Q4461916 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4532231
@@ Property / cites work: Q4532231 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687193
@@ Property / cites work: Q5687193 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q4461915
@@ Property / cites work: Q4461915 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461911
@@ Property / cites work: Q4461911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Orienteering Tour Problem
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/NET.20170
@@ Property / DOI: 10.1002/NET.20170 / rank @@
+Normal rank