Graphical-structure-based models for routing problems (Q3799805): Difference between revisions

@@ Property / cites work @@
+The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
+Normal rank
@@ Property / cites work @@
+Q3277097
@@ Property / cites work: Q3277097 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of spanning tree problems: Part I
@@ Property / cites work: Complexity of spanning tree problems: Part I / rank @@
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
+Normal rank
@@ Property / cites work @@
+A Heuristic Algorithm for the Vehicle-Dispatch Problem
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Balanced optimization problems
@@ Property / cites work: Balanced optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank
@@ Property / cites work @@
+Technical Note—An Effective Heuristic for the <i>M</i>-Tour Traveling Salesman Problem with Some Side Conditions
+Normal rank