An improved lower bound and approximation algorithm for binary constrained quadratic programming problem.
Cheng LuZhenbo WangWenxun XingPublished in: J. Glob. Optim. (2010)
Keyphrases
- dynamic programming
- lower bound
- worst case
- computationally efficient
- np hard
- optimal solution
- preprocessing
- theoretical analysis
- upper bound
- detection algorithm
- search space
- error bounds
- times faster
- closed form
- optimization algorithm
- learning algorithm
- network flow
- significant improvement
- k means
- computational complexity
- objective function
- competitive ratio
- polynomial time approximation
- lower and upper bounds
- error tolerance
- branch and bound algorithm
- linear programming
- convergence rate
- combinatorial optimization
- matching algorithm
- probabilistic model
- special case
- data structure
- decision trees