Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
From MaRDI portal
Recommendations
- Phase Transitions in Combinatorial Optimization Problems
- Refining the phase transition in combinatorial search
- Phase transitions in parameter rich optimization problems
- scientific article; zbMATH DE number 2151246
- An optimization algorithm inspired by the phase transition phenomenon for global optimization problems with continuous variables
- Locating the phase transition in binary constraint satisfaction problems
- Phase transitions of EXPSPACE-complete problems
- Phase transitions of EXPSPACE-complete problems: a further step
- An empirical study of phase transitions in binary constraint satisfaction problems
- Phase transitions in semidefinite relaxations
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3908167 (Why is no real title available?)
- scientific article; zbMATH DE number 15993 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 67459 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3327849 (Why is no real title available?)
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- A study of complexity transitions on the asymmetric traveling salesman problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Branch-and-Bound Methods: A Survey
- Computational Efficiency of Approximate Branch-and-Bound Algorithms
- Exploiting the deep structure of constraint problems
- Flowshop scheduling with limited temporary storage
- Generalized best-first search strategies and the optimality of A*
- Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
- Local Search for the Asymmetric Traveling Salesman Problem
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Performance of linear-space search algorithms
- Searching for an optimal path in a tree with random costs
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Using branch-and-bound algorithms to obtain suboptimal solutions
Cited in
(5)- A study of complexity transitions on the asymmetric traveling salesman problem
- Performance of linear-space search algorithms
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Iterative state-space reduction for flexible computation
- Phase Transitions in Combinatorial Optimization Problems
This page was built for publication: Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674191)
