Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
DOI10.1504/IJMHEUR.2010.034201zbMATH Open1223.90036OpenAlexW2100571366MaRDI QIDQ537995FDOQ537995
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
Recommendations
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
- \(f\)-flip strategies for unconstrained binary quadratic programming
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
metaheuristicscomputational efficiencytabu searchtwo-flip movesunconstrained quadratic programmingzero-one optimisation
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Cited In (6)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- \(f\)-flip strategies for unconstrained binary quadratic programming
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A hybrid metaheuristic approach to solving the UBQP problem
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
This page was built for publication: Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537995)
