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 Global Optimization

An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach

Duan Li, X. L. Sun, C. L. Liu

Published Apr 8, 2011• 25 citations
Publisher
DOI
10.1007/s10898-011-9713-2

Related papers

A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming

Pierre Hansen, Brigitte Jaumard, Christophe Meyer

Les Cahiers du GERAD•Nov 1, 2000•12 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•540 citations

Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem

Alain Billionnet, Sourour Elloumi

Mathematical Programming•Jun 2, 2006•185 citations

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Sourour Elloumi, Amélie Lambert, Arnaud Lazare

arXiv:1901.07904•Journal of Global Optimization•Jan 4, 2021•24 citations

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

Eranda Çela, Bettina Klinz, Christophe Meyer

Journal of Combinatorial Optimization•Aug 14, 2006•15 citations

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming

Xinyue Huo, Ran Gu

arXiv:2408.04875•Journal of Optimization Theory and Applications•Nov 15, 2025•2 citations