Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm.
J.-A. FerrezKomei FukudaThomas M. LieblingPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- optimal solution
- quadratic programming
- dynamic programming
- objective function
- cost function
- np hard
- convex quadratic
- knapsack problem
- convergence rate
- energy function
- linear programming
- search space
- computational complexity
- expectation maximization
- simulated annealing
- worst case
- piecewise linear
- continuous variables
- lower bound
- binary variables