On the high multiplicity traveling salesman problem (Q2494812): Difference between revisions

@@ Property / DOI @@
-.1016/j.disopt.2005.11.002
@@ Property / DOI: 10.1016/j.disopt.2005.11.002 / rank @@
-Normal rank
@@ Property / cites work @@
+No-wait flow shop scheduling with large lot sizes
@@ Property / cites work: No-wait flow shop scheduling with large lot sizes / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with high multiplicity
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Many Visits to Few Cities
+Normal rank
@@ Property / cites work @@
+Arc Routing Problems, Part I: The Chinese Postman Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling with limited temporary storage
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
+Normal rank
@@ Property / DOI @@
+.1016/J.DISOPT.2005.11.002
@@ Property / DOI: 10.1016/J.DISOPT.2005.11.002 / rank @@
+Normal rank