Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conference on Scientific Computing

A Hybrid Heuristic for Solving Unconstrained Binary Quadratic Programming Problems.

Kien Ming Ng

Published Jan 1, 2007• 0 citations
OpenAlex

Related papers

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

Kengo Katayama, Hiroyuki Narihisa

European Journal of Operational Research•Oct 1, 2001•100 citations

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Peter Merz, Bernd Freisleben

Journal of Heuristics•Mar 1, 2002•147 citations

Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search

Vladimir P. Shylo, Oleg V. Shylo

Cybernetics and Systems Analysis•Nov 1, 2011•8 citations

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

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

European Journal of Operational Research•Mar 1, 2002•71 citations

The unconstrained binary quadratic programming problem: a survey

Gary A. Kochenberger, Jin‐Kao Hao, Fred Glover +4 more

Journal of Combinatorial Optimization•Apr 17, 2014•479 citations

Solving unconstrained binary quadratic programming using binary particle swarm optimization

Geng Lin

WIT transactions on information and communication technologies•Oct 1, 2013•0 citations