Login / Signup

SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning.

Frank de MeijerRenata Sotirov
Published in: INFORMS J. Comput. (2021)
Keyphrases
  • reinforcement learning
  • objective function
  • bayesian networks
  • feature space
  • lower bound
  • constraint satisfaction problems
  • optimization methods
  • upper bound
  • image denoising
  • cutting plane