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

Journal of Heuristics

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Peter Merz, Bernd Freisleben

Published Mar 1, 2002• 147 citations
Publisher
DOI
10.1023/a:1017912624016

Related papers

A Hybrid Heuristic for Solving Unconstrained Binary Quadratic Programming Problems.

Kien Ming Ng

Conference on Scientific Computing•Jan 1, 2007•0 citations

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Endre Boros, Peter L. Hammer, Gabriel Tavares

Journal of Heuristics•Feb 20, 2007•142 citations

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

Simple Enhancements of Local Search Methods for the Binary Quadratic Programming Problem

謙吾 片山, 洋之 成久

岡山理科大学紀要. A, 自然科学•Jan 1, 2001•0 citations

A scatter search approach to unconstrained quadratic binary programs

Mohammad M. Amini, Bahram Alidaee, Gary A. Kochenberger

McGraw-Hill Ltd., UK eBooks•Jan 1, 1999•46 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