Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem

•We propose two closed-form formulas to quickly reevaluate r-flip moves.•Algorithms are designed which are simple to implement and fast to compute.•We test our results using local search and Variable Neighborhood Search heuristics.•Experiments show relatively large reductions in time consumption usi...

Ausführliche Beschreibung