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

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

Eranda Çela, Bettina Klinz, Christophe Meyer

Published Aug 14, 2006• 15 citations
Publisher
DOI
10.1007/s10878-006-9625-0

Related papers

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

Polynomially Solvable Cases of Binary Quadratic Programs

Duan Li, Xiaoling L. Sun, Shenshen Gu +2 more

Springer optimization and its applications•Jan 1, 2010•16 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

A polynomial case of unconstrained zero-one quadratic optimization

Kim Allemand, Komei Fukuda, Thomas M. Liebling +1 more

Mathematical Programming•Oct 1, 2001•75 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