On the depth of combinatorial optimization problems (Q1801676): Difference between revisions

@@ Property / cites work @@
+The shortest path and the shortest road through             <i>n</i>             points
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Cooling Schedules for Optimal Annealing
@@ Property / cites work: Cooling Schedules for Optimal Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5732992
@@ Property / cites work: Q5732992 / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707785
@@ Property / cites work: Q3707785 / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3340896
@@ Property / cites work: Q3340896 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence of an annealing algorithm
@@ Property / cites work: Convergence of an annealing algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Local Search for the Traveling Salesman Problem
+Normal rank