Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems

DOI10.1504/IJMHEUR.2010.034201zbMath1223.90036OpenAlexW2100571366MaRDI QIDQ537995

Jin-Kao Hao, Fred Glover

Publication date: 23 May 2011

Published in: International Journal of Metaheuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmheur.2010.034201

zbMATH Keywords

metaheuristicstabu searchcomputational efficiencyunconstrained quadratic programmingtwo-flip moveszero-one optimisation

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (6)

\(f\)-flip strategies for unconstrained binary quadratic programming ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation ⋮ Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem

This page was built for publication: Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems