We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We present MIP relaxation methods for non-convex continuous variable products. In this paper, we consider MIP relaxations based on...

This is Part II of a study on mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We set the focus on MIP relaxation methods for non-convex continuous variable products where both variables are...

Purpose: Automatic grouping of data according to certain characteristics is made possible by clustering algorithms, which makes them an essential tool when working with large datasets. However, although they are unsupervised tools, they generally require the specification of the number of...

We revisit a service provider's problem to match supply and demand via an online appointment system such as a doctor in the health care sector. We identify in a survey that an extensive set of available appointments leads to significantly less demand because customers infer a lower quality of...

We propose a high-frequency rebalancing algorithm (HFRA) and compare its performance with periodic rebalancing (PR) and threshold rebalancing (TR) strategies. PR refers to the process of adjusting the relative weight of assets within portfolios at regular time intervals, whereas TR is a process...

Predictions of the individual unemployment duration will allow to distribute target support while searching for a job more effectively. The paper uses survival models to predict the unemployment duration based on data from Russian employment centers in 2017-2021. The dataset includes...