The cardinality constrained covering traveling salesman problem (Q1869889): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Partitioning graphs into Hamiltonian ones
@@ Property / cites work: Partitioning graphs into Hamiltonian ones / rank @@
+Normal rank
@@ Property / cites work @@
+The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
+Normal rank
@@ Property / cites work @@
+Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
+Normal rank
@@ Property / cites work @@
+A bound for the symmetric travelling salesman problem through matroid formulation
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Estimating the Held-Karp lower bound for the geometric TSP
+Normal rank