Hakan Aygoren

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
One of the most studied variant of portfolio optimization problems is with cardinality constraints that transform classical mean-variance model from a convex quadratic programming problem into a mixed integer quadratic programming problem which brings the problem to the class of NP-Complete problems. Therefore, the computational complexity is significantly(More)
  • 1