Combinatorial optimization is a challenging yet crucial class of problems, and Simulated Bifurcation (SB) is a promising approximate solver developed in recent years. The authors enhance SB with ideas from Tabu Search to improve its performance, demonstrating clear gains on Max-Cut and particle track reconstruction problems.
- Xian-Zhe Tao
- Qing-Guo Zeng
- Man-Hong Yung