Login / Signup

Lagrangean decompositions for the unconstrained binary quadratic programming problem.

Geraldo Regis MauriLuiz Antonio Nogueira Lorena
Published in: Int. Trans. Oper. Res. (2011)
Keyphrases
  • column generation
  • lower bound
  • upper bound
  • set covering problem
  • data sets
  • multi valued
  • real time
  • optimal solution
  • multi class
  • integer programming
  • binary classifiers
  • non binary
  • binary data