Login / Signup

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems.

Shenshen GuRui CuiJiao Peng
Published in: Neurocomputing (2016)
Keyphrases
  • linearly constrained
  • learning algorithm
  • objective function
  • computational complexity
  • high dimensional
  • sensitivity analysis