.png){kind=icon}
返回
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2019.09.043.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the Mixed-Integer Bilinear Programming problem, a widely-used reformulation of the classical mixed-integer quadratic programming problem. For this problem we describe a branch and -cut algorithm for its exact solution, based on a new family of intersection cuts derived from bilinearspecific disjunctions. We also introduce a new branching rule that is specifically designed for bilinear problems. We computationally analyze the behavior of the proposed algorithm on a large set of mixed-integer quadratic instances from the MINLPIib problem library. Our results show that our method, even without intersection cuts, is competitive with a state-of-the-art mixed-integer nonlinear solver. As to intersection cuts, their extensive use at each branching node tends to slow down the solver for most problems in our test bed, but they are extremely effective for some specific instances. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Mixed-integer quadratic programming
Bilinear programming
Branch-and-cut algorithms
Intersection cuts
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏Cotton Based Self-Powered Temperature Sensor Based on Au-Augmented WS2 Triboelectric Nanogenerator
PREAI
分享收藏
查看更多内容