You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Update: Dynex finds best-known MaxCut for the Stanford G70 benchmark
The cut size [9,553](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/maxcut_best_9553.pkl) for [G70](https://web.stanford.edu/~yyye/yyye/Gset/) found by Dynex is the best-known MaxCut than previous reported results on June 8th 2024. The previous record of 9,541 was found using a special purpose algorithm designed for MaxCut ([Breakout Local Search for the Max-Cut problem](https://www.researchgate.net/publication/257392755_Breakout_Local_Search_for_the_Max-Cutproblem)) in 2013. It is worth noting that an increase of one better cut involves an exponentially increasing complexity.
The cut size [9,553](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/maxcut_best_9553.pkl) for [G70](https://web.stanford.edu/~yyye/yyye/Gset/) found by [Dynex](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/G70_dynex.ipynb) is the best-known MaxCut than previous reported results on June 8th 2024. The previous record of 9,541 was found using a special purpose algorithm designed for MaxCut ([Breakout Local Search for the Max-Cut problem](https://www.researchgate.net/publication/257392755_Breakout_Local_Search_for_the_Max-Cutproblem)) in 2013. It is worth noting that an increase of one better cut involves an exponentially increasing complexity.
