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

New bounds on the unconstrained quadratic integer programming problem

George D. Halikias, Imad M. Jaimoukha, U. Malik, S. K. Gungah

Published Apr 24, 2007• 11 citations
Publisher
DOI
10.1007/s10898-007-9155-z

Related papers

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

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Lecture notes in computer science•Jan 1, 2010•10 citations

An effective branch-and-bound algorithm for convex quadratic integer programming

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Mathematical Programming•Jul 14, 2011•57 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

On the gap between the quadratic integer programming problem and its semidefinite relaxation

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

Mathematical Programming•Dec 30, 2005•34 citations

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

Pierre Bonami, Oktay Günlük, Jeff Linderoth

Mathematical Programming Computation•Feb 24, 2018•40 citations