Copositivity is a property of symmetric matrices which is NP-hard to check. Nevertheless, it plays a crucial role in tight bounds for conic approaches of several hard optimization problems. In this paper, we present novel promising shortcut strategies to exploit favorable instances in a...

Copositivity is a property of symmetric matrices which is NP-hard to check. Nevertheless, it plays a crucial role in tight bounds for conic approaches of several hard optimization problems. In this paper, we present novel promising shortcut strategies to exploit favorable instances in a...

We present a branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set. The method relies on outer approximations of the upper image set of continuous relaxations. These...

A recent paper by Schulze et al. (Math Methods Oper Res 92(1):107–132, 2020) presented the Rectangular Knapsack Problem ( Rkp ) as a crucial subproblem in the study on the Cardinality-constrained Bi-objective Knapsack Problem ( Cbkp ). To this end, they started an investigation into its...