Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
type: Item
instance of: scholarly article
title: Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
zbMATH Open document ID: 1223.90036
DOI: 10.1504/IJMHEUR.2010.034201
author: Fred Glover
author: Jin-Kao Hao
published in: International Journal of Metaheuristics
publication date: 2011-05-23T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5898986
zbMATH Keywords: zero-one optimisation
zbMATH Keywords: unconstrained quadratic programming
zbMATH Keywords: metaheuristics
zbMATH Keywords: computational efficiency
zbMATH Keywords: two-flip moves
zbMATH Keywords: tabu search
MaRDI profile type: Publication
full work available at URL: ijmheur.2010.034201
OpenAlex ID: W2100571366
description: scientific article; zbMATH DE number 5898986