Journal of Heuristics

Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems

Saïd Hanafi, Ahmed Rebaï, Michel Vasquez

Published Jun 7, 2011• 10 citations

Related papers

A Hybrid Heuristic for Solving Unconstrained Binary Quadratic Programming Problems.

Kien Ming Ng

One-pass heuristics for large-scale unconstrained binary quadratic problems

Fred Glover, Bahram Alidaee, César Rego +1 more

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Peter Merz, Bernd Freisleben

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

Kengo Katayama, Hiroyuki Narihisa

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Endre Boros, Peter L. Hammer, Gabriel Tavares

Heuristic algorithms based on deep reinforcement learning for quadratic unconstrained binary optimization

Ming Chen, Yuning Chen, Yonghao Du +2 more