1 paper
Rick Keesman, Pepijn Overbeeke
We introduce a weighed-loop algorithm that is applicable to any weighed graph network. It is designed to prefer a route of energetically unfavourable bonds in the lattice that can…