.png){kind=icon}
.png){kind=icon}
Return
A decision space algorithm for multiobjective convex quadratic integer optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2021.105396.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Multiobjective optimization
Convex quadratic optimization
Integer quadratic programming
Branch-and-bound algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W