A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming.

Gintaras Palubeckis

Published in: Computing (2006)

Keyphrases

quadratic programming
lower bound
special case
upper bound
linear programming
np hard
worst case
objective function
support vector machine
approximation algorithms
lower and upper bounds
quadratic program
linear program
bayesian inference
test set
dynamic programming
optimal solution