Solving Covering Problems Using LPR-Based Lower Bounds.

Stan Y. Liao Srinivas Devadas

Published in: DAC (1997)

Keyphrases

lower bound
solving problems
randomly generated problems
resource constrained project scheduling problem
branch and bound
quadratic programming
np hard
upper bound
worst case
np complete
combinatorial optimization
convex quadratic programming