Principal Component hierarchy for sparse quadratic programs

We propose a novel approximation hierarchy for cardinality-constrained, convex quadraticprograms that exploits the rank-dominating eigenvectors of the quadratic matrix. Each levelof approximation admits a min-max characterization whose objective function can be op-timized over the binary variables analytically, while preserving convexity in the...

Optimization of the capacity of a rose sorting system using discrete event simulation

In Rose cultivation companies in the Netherlands, there is a demand for a higher sorting capacity on the existing sorting systems. The objective for this research is to advice which part of the sorting system needs to be adjusted to gain a higher sorting capacity. For the current sorting systems, five bottlenecks are defined, the bottlenecks...