An exact method for the double TSP with multiple stacks (Q3002549): Difference between revisions

@@ Property / DOI @@
-.1111/j.1475-3995.2009.00748.x
@@ Property / DOI: 10.1111/j.1475-3995.2009.00748.x / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2008642135
@@ Property / OpenAlex ID: W2008642135 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
+Normal rank
@@ Property / cites work @@
+The symmetric clustered traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
+Normal rank
@@ Property / cites work @@
+Stability aspects of the traveling salesman problem based on \(k\)-best solutions
+Normal rank
@@ Property / DOI @@
+.1111/J.1475-3995.2009.00748.X
@@ Property / DOI: 10.1111/J.1475-3995.2009.00748.X / rank @@
+Normal rank