We present a branch-and-bound algorithm for minimizing multiple convex quadratic objective functions over integer variables. Our method looks for efficient points by fixing subsets of variables to integer values and by using lower bounds in the form of hyperplanes in the image space derived from the continuous relaxations of the restricted objective functions. We show that the algorithm stops after finitely many fixings of variables with detecting both the full efficient and the nondominated set of multiobjective strictly convex quadratic integer problems. A major advantage of the approach is that the expensive calculations are done in a preprocessing phase so that the nodes in the branch-and-bound tree can be enumerated fast. We show numerical experiments on biobjective instances and on instances with three and four objectives.
2021, COMPUTERS & OPERATIONS RESEARCH, Pages - (volume: 134)
A decision space algorithm for multiobjective convex quadratic integer optimization (01a Articolo in rivista)
De Santis M., Eichfelder G.
Gruppo di ricerca: Continuous Optimization