期刊
OPTIMIZATION
卷 67, 期 8, 页码 1143-1156出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2018.1456539
关键词
Multi-objective programming; integer programming; quadratic programming; branch and cut
In this paper, a new exact method is proposed for solving the maximization problem, say, of an indefinite quadratic utility function over the efficient set of a multi-objective integer linear programming (MOILP) problem. Indeed, we develop a branch and cut algorithm based on a continuous indefinite quadratic optimization, for reaching an integer optimal solution of problem without having to enumerate explicitly all integer efficient solutions of MOILP problem. The branch and bound process, strengthened by efficient cuts and tests, allows us to fathom considerably nodes in the tree. Thus, a large number of feasible and non-efficient solutions can be avoided. An experimental study is reported to validate the theoretical results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据