Browsing Management Sciences by Subject "Branch-and-Bound"
Now showing items 1-1 of 1
-
New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems
(University of Waterloo, 2011-08-26)Polynomial programming, a class of non-linear programming where the objective and the constraints are multivariate polynomials, has attracted the attention of many researchers in the past decade. Polynomial programming is ...