On the Slow Convergence to Trivial Solutions of Algorithms for Hard Optimization Problems

Ali Hussaini Umar, Jean Barbier, Matthieu Jonckheere +1

Hard combinatorial optimization problems, many of which are NP-hard, present fundamental algorithmic challenges. Average-case analysis on random instances has emerged as a powerful…