Login / Signup
A Generalization of a Lower Bound Technique due to Fredman and Saks.
Amir M. Ben-Amram
Zvi Galil
Published in:
Algorithmica (2001)
Keyphrases
</>
lower bound
upper bound
branch and bound
lower and upper bounds
branch and bound algorithm
optimal solution
upper and lower bounds
np hard
worst case
objective function
efficient learning
polynomial approximation
branch and bound method
information retrieval
lagrangian relaxation