.png){kind=icon}
返回
Efficient MIP techniques for computing the relaxation complexity
.png){kind=icon}
OA
AI
DOI：10.1007/s12532-023-00241-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The relaxation complexity rc(X) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem over X without using auxiliary variables. Besides its relevance in integer programming, this concept has interpretations in aspects of social choice, symmetric cryptanalysis, and machine learning. We employ efficient mixed-integer programming techniques to compute a robust and numerically more practical variant of the relaxation complexity. Our proposed models require row or column generation techniques and can be enhanced by symmetry handling and suitable propagation algorithms. Theoretically, we compare the quality of our models in terms of their LP relaxation values. The performance of those models is investigated on a broad test set and is underlined by their ability to solve challenging instances that could not be solved previously.
Keyword:
Mixed-integer programming models
Relaxation complexity
Branch-and-price
Branch-and-cut
期刊
IF:
3.6
论文数:
199
被引数:
1.9K
机构
引用论文
.png){kind=icon}
分享收藏Femtosecond transient absorption study of excitons in quasi‐one‐dimensional MX‐chain compounds飞秒瞬态吸收研究准一维MX-链化合物中的激子
PREAI
分享收藏Unveiling the holomorph and novel host records of
Shearia formosa
(
Longiostiolaceae, Pleosporales
) in China揭开holomorph和小说的主机记录
Shearia formosa
(
长尾草科，孢粉鱼
) 在中国
PREAI
分享收藏分享收藏Photogeneration of conducting polymer patterns in iodinated cis-1,4-polybutadiene films在碘化顺-1,4-聚丁二烯薄膜中导电聚合物的光生图案
PREAI
分享收藏Propriétés optiques et structurales des agrégats de bromure d'argent dans une matrice ionique溴化银聚集体的光学和结构特性在离子基质中
PREAI
分享收藏
查看更多内容