Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191): 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.1016/0004-3702(95)00057-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2091208389
@@ Property / OpenAlex ID: W2091208389 / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
+Normal rank
@@ Property / cites work @@
+Q3686500
@@ Property / cites work: Q3686500 / rank @@
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized best-first search strategies and the optimality of A*
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+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 @@
+Computational Efficiency of Approximate Branch-and-Bound Algorithms
+Normal rank
@@ Property / cites work @@
+Using branch-and-bound algorithms to obtain suboptimal solutions
+Normal rank
@@ Property / cites work @@
+Q4038710
@@ Property / cites work: Q4038710 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Searching for an optimal path in a tree with random costs
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: A Survey
@@ Property / cites work: Branch-and-Bound Methods: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972640
@@ Property / cites work: Q3972640 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012185
@@ Property / cites work: Q4012185 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling with limited temporary storage
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup>
+Normal rank
@@ Property / cites work @@
+Q5606305
@@ Property / cites work: Q5606305 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting the deep structure of constraint problems
+Normal rank
@@ Property / cites work @@
+Performance of linear-space search algorithms
@@ Property / cites work: Performance of linear-space search algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A study of complexity transitions on the asymmetric traveling salesman problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2674191