Login / Signup
A new upper bound for the 0-1 quadratic knapsack problem.
Alain Billionnet
Alain Faye
Éric Soutif
Published in:
Eur. J. Oper. Res. (1999)
Keyphrases
</>
upper bound
lower bound
worst case
knapsack problem
branch and bound
branch and bound algorithm
upper and lower bounds
lower and upper bounds
generalization error
single item
closed form expressions
error probability
decision trees
three dimensional
linear programming