Login / Signup
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation.
Sourour Elloumi
Amélie Lambert
Arnaud Lazare
Published in:
J. Glob. Optim. (2021)
Keyphrases
</>
constrained minimization
computer programs
polynomial equations
learning algorithm
search space
dynamic programming
loss function
linear programming problems
convex programming
symmetric matrix
multicommodity flow problems