Login / Signup

Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints.

Aykut AhlatçiogluMichael R. BussieckMustafa EsenMonique GuignardJan-Hendrick JaglaAlexander Meeraus
Published in: Ann. Oper. Res. (2012)
Keyphrases
  • linear constraints
  • convex quadratic
  • np complete
  • quadratic program
  • linearly constrained
  • solving problems
  • nonlinear programming
  • constraint handling rules