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• 14 citations

Related papers

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

Shenshen Gu, Rui Cui, Peng Jiao

Polynomially Solvable Cases of Binary Quadratic Programs

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

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Sourour Elloumi, Amélie Lambert, Arnaud Lazare

A polynomial case of unconstrained zero-one quadratic optimization

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

New bounds on the unconstrained quadratic integer programming problem

George D. Halikias, Imad M. Jaimoukha, U. Malik +1 more

The unconstrained binary quadratic programming problem: a survey

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