A decomposition method for quadratic zero-one programming
Management Science
Tabu Search
A new modeling and solution approach for the set-partitioning problem
Computers and Operations Research
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
International Journal of Metaheuristics
Polynomial unconstrained binary optimisation-part 2
International Journal of Metaheuristics
| Hi-index | 0.00 |
We provide a method for efficiently evaluating two-flip moves that simultaneously change the values of two 0-1 variables in search methods for binary unconstrained quadratic optimisation problems (UQP). We extend a framework recently proposed by the authors for creating efficient evaluations of one-flip moves to yield a method requiring significantly less computation time than a direct sequential application of one-flips. A tabu search algorithm that combines one-flip and two-flip moves, in a study currently in process, has made use of this extension to produce very competitive results on some UQP benchmark instances.