.png){kind=icon}
返回
A branch-and-cut technique to solve multiobjective integer quadratic programming problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-017-2698-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article proposes an exact method to solve the integer programming problem featuring several convex quadratic functions to be minimized (henceforth denoted by MOIQP). The proposed algorithm is a branch and bound based technique suitable for MOIQP problems to generate the set of all efficient solutions. The features of the method are as follows. First, the branch and bound technique allows solving the relaxed problem according to any linear function and progressively generates integer solutions. Then, the efficient cut proposed reduces the search area by truncating domains containing non efficient solutions without having to enumerate them. Finally, at each node of the tree search, three fathoming rules are used to enhance the speed of the procedure. Computational experiments are presented in order to analyze the performance of the algorithm.
Keyword:
Multiobjective optimization
Quadratic programming
Branch and bound
Efficient cuts
Multiobjective quadratic integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
暂无机构信息
引用论文
Financial Market Development and Economic Growth. New or Old Nexus in the Euro Area?金融市场发展与经济增长。欧元区是新联系还是旧联系？
OAAI
OAAI分享收藏Transformation of organic rhizodepositions by rhizosphere bacteria and its influence on the availability of tertiary calcium phosphate.根际细菌对有机根际沉积的转化及其对叔磷酸钙有效性的影响。.png)
IF0
PREAI
分享收藏Suitable-portfolio investors, nondominated frontier sensitivity, and the effect of multiple objectives on standard portfolio selection合适的投资组合投资者、非支配前沿敏感性和多个目标对标准投资组合选择的影响
PREAI
分享收藏Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds
OAAI
OAAI分享收藏 没有更多内容
没有更多内容