Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints.
Eduardo A. J. AnacletoCláudio N. MenesesRicardo N. LiangPublished in: Comput. Oper. Res. (2021)
Keyphrases
- closed form
- upper bound
- quadratic programming problems
- equality constraints
- closed form solutions
- lower bound
- closed form expressions
- linear constraints
- worst case
- point correspondences
- constrained optimization
- partition function
- real valued
- branch and bound algorithm
- decomposition algorithm
- maximum likelihood
- multi class
- approximation algorithms