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

Les Cahiers du GERAD

A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming

Pierre Hansen, Brigitte Jaumard, Christophe Meyer

Published Nov 1, 2000• 12 citations
OpenAlex

Related papers

A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming

Gintaras Palubeckis

Computing•Dec 1, 1995•32 citations

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

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

Journal of Global Optimization•Apr 8, 2011•25 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

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

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

Neurocomputing•Mar 9, 2016•5 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