We present BiqBin, an exact solver for linearly constrained binary quadratic problems. Our
approach is based on an exact penalty method to first efficiently transform the original …

This paper aims to answer an open question recently posed in the literature, that is to find a
fast exact method for solving the max-sum diversity problem, a nonconcave quadratic binary …

In this paper, we address the optimal operation of a virtual power plant using stochastic
programming. We consider one risk-neutral and two risk-averse formulations that rely on the …

We present a machine learning-powered iterative combinatorial auction (MLCA). The main
goal of integrating machine learning (ML) into the auction is to improve preference …

Finding good solutions to clique partitioning problems remains a computational challenge.
With rare exceptions, finding optimal solutions for all but small instances is not practically …

The assignment of personnel to teams is a fundamental managerial function typically
involving several objectives and a variety of idiosyncratic practical constraints. Despite the …

This paper is concerned with binary quadratic programs (BQPs), which are among the most
well‐studied classes of nonlinear integer optimization problems because of their wide …

This paper studies binary quadratic programs in which the objective is defined by the
maximisation of a Euclidean distance matrix, subject to a general polyhedral constraint set …

We address the problem of minimizing a quadratic function subject to linear constraints over
binary variables. We introduce the exact solution method called EXPEDIS where the …

Adversarial training is a common approach to improving the robustness of deep neural
networks against adversarial examples. In this work, we propose a novel regularization …