Sensitivity analysis for symmetric 2-peripatetic salesman problems (Q2367396): Difference between revisions

@@ Property / cites work @@
+Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
+Normal rank
@@ Property / cites work @@
+Bounds for the symmetric 2-peripatetic salesman problem
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Q4068472
@@ Property / cites work: Q4068472 / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: A Survey
@@ Property / cites work: Branch-and-Bound Methods: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
+Normal rank