Exact solutions to the double travelling salesman problem with multiple stacks (Q3064039): 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.1002/net.20375
@@ Property / full work available at URL: https://doi.org/10.1002/net.20375 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1995133416
@@ Property / OpenAlex ID: W1995133416 / rank @@
+Normal rank
@@ Property / cites work @@
+Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Path inequalities for the vehicle routing problem with time windows
+Normal rank
@@ Property / cites work @@
+The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3064039