Improved exact method for the double TSP with multiple stacks (Q3113513): Difference between revisions

@@ Property / describes a project that uses @@
+Concorde
@@ Property / describes a project that uses: Concorde / rank @@
+Normal rank
@@ 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.1002/net.20473
@@ Property / full work available at URL: https://doi.org/10.1002/net.20473 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1985009750
@@ Property / OpenAlex ID: W1985009750 / 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 @@
+The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
+Normal rank
@@ Property / cites work @@
+New neighborhood structures for the double traveling salesman problem with multiple stacks
+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 @@
+An exact method for the double TSP with multiple stacks
+Normal rank
@@ Property / cites work @@
+The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
+Normal rank