Solving the shortest route cut and fill problem using simulated annealing (Q1869428): Difference between revisions

@@ Property / author @@
+Jacobson, Sheldon H.
@@ Property / author: Jacobson, Sheldon H. / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365126
@@ Property / cites work: Q4365126 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
+Normal rank
@@ Property / cites work @@
+The swapping problem
@@ Property / cites work: The swapping problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Capacitated Routing and Delivery Problems
+Normal rank
@@ Property / cites work @@
+Simulated annealing: A tool for operational research
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Metaheuristics for a flexible assembly system design problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank