Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2009.03.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2036433802
@@ Property / OpenAlex ID: W2036433802 / rank @@
+Normal rank
@@ Property / cites work @@
+A constraint programming approach to the Chinese postman problem with time windows
+Normal rank
@@ Property / cites work @@
+Heuristics for the black and white traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q4040797
@@ Property / cites work: Q4040797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5614003
@@ Property / cites work: Q5614003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
+Normal rank
@@ Property / cites work @@
+The travelling salesman problem with pick-up and delivery
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+The pickup and delivery problem: Faces and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank