Mathematical Programming

A polynomial case of unconstrained zero-one quadratic optimization

Kim Allemand, Komei Fukuda, Thomas M. Liebling, Erich Steiner

Published Oct 1, 2001• 76 citations

Related papers

Unconstrained 0-1 polynomial optimization through convex quadratic reformulation

Amélie Lambert, Sourour Elloumi, Arnaud Lazare

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

Eranda Çela, Bettina Klinz, Christophe Meyer

Computing Local Optima in Quadratic Unconstrained Binary Optimization Problems in Randomized Polynomial Time

Lunshan Gao

Unconstrained binary quadratic optimization

Erich Steiner, Th. M. Liebling, Komei Fukuda +1 more

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

Gintaras Palubeckis

Binary Unconstrained Quadratic Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang