Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming.
Hong-Xuan HuangPanos M. PardalosOleg A. ProkopyevPublished in: Comput. Optim. Appl. (2006)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- optimal solution
- lower and upper bounds
- programming language
- classification rules
- pairwise
- worst case
- significant improvement
- lower bounding
- quadratically constrained quadratic
- multi class
- polynomial approximation
- linear programming relaxation
- convex functions
- rule learning
- upper and lower bounds
- development environment
- rule induction
- data structure
- sample complexity
- association rules