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

Mathematics

• Relative Error 100%
• Asymmetric 100%
• Combinatorial Optimization Problem 100%
• Polynomial 100%
• Traveling Salesman Problem 100%
• Transformation Method 100%
• Average-Case Complexity 100%
• Local Search 100%

Keyphrases

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

Computer Science

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