Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
From MaRDI portal
Publication:537985
DOI10.1504/IJMHEUR.2010.033120zbMath1219.90104OpenAlexW2164584399MaRDI QIDQ537985
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.033120
metaheuristicstabu searchcomputational efficiency0-1 optimisationunconstrained quadratic programming
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
\(f\)-flip strategies for unconstrained binary quadratic programming, The Bipartite QUBO, Building an iterative heuristic solver for a quantum annealer, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, Solving the maximum vertex weight clique problem via binary quadratic programming, The bipartite quadratic assignment problem and extensions, Partial evaluation in rank aggregation problems, A tabu search algorithm with controlled randomization for constructing feasible university course timetables, 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, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Quadratic reformulations of nonlinear binary optimization problems, Path relinking for unconstrained binary quadratic programming, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
