Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems

Keyphrases

• Phase Transition 100%
• Combinatorial Optimization Problem 100%
• Depth-first 100%
• Search Depth 60%
• Branch-and-bound 40%
• Asymmetric Traveling Salesman Problem 40%
• Goal Node 40%
• Random Tree 40%
• Node number 20%
• Search Problems 20%
• Expected number 20%
• Average-case Complexity 20%
• Tree Model 20%
• Relative Error 20%
• Suboptimal Solutions 20%
• Local Search Algorithm 20%
• Tree Search 20%
• Branching Factor 20%
• Complexity Transitions 20%
• Boolean Satisfiability Problem 20%
• Treedepth 20%

Computer Science

• Combinatorial Optimization Problem 100%
• Branch-and-Bound Algorithm Design 100%
• Traveling Salesman Problem 100%
• Experimental Result 50%
• Relative Error 50%
• Tree Search 50%
• Local Search Method 50%
• Satisfiability Problem 50%
• Case Complexity 50%
• Branching Factor 50%

Mathematics

• Asymmetric 100%
• Combinatorial Optimization Problem 100%
• Traveling Salesman Problem 100%
• Relative Error 50%
• Polynomial 50%
• Average-Case Complexity 50%
• Approach Infinity 50%
• Local Search 50%