Login / Signup
A binarisation heuristic for non-convex quadratic programming with box constraints.
Laura Galli
Adam N. Letchford
Published in:
Oper. Res. Lett. (2018)
Keyphrases
</>
convex quadratic programming
constraint satisfaction
search algorithm
solution quality
mixed integer program
simulated annealing
tabu search
constraint violations
dantzig wolfe
reinforcement learning
cooperative
training set
integer programming
constrained optimization