.png){kind=icon}
返回
Solving 0-1 Quadratic Programs by Reformulation Techniques
.png){kind=icon}
PRE
AI
DOI：10.1021/acs.iecr.7b01270.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We derive and study a reformulation technique for general 0-1 quadratic programs (QP) that uses diagonal as well as nondiagonal perturbation of the objective function. The technique is an extension of the Quadratic Convex Reformulation (QCR) method developed by Billionnet and co-workers, adding nondiagonal perturbations, whereas QCR is in a sense diagonal. In this work a set of redundant reformulation-linearization technique (RLT) inequalities are included in the problem. The redundant inequalities are used to induce nondiagonal perturbations of the objective function that improve the bounding characteristics of the continuous relaxation. The optimal convexification is obtained from the solution of a semidefinite program. We apply the nondiagonal QCR (NDQCR) technique to four different types of problems and compare the bounding properties and solution times with the original QCR method. The proposed method outperforms the original QCR method on all four types of test problems.
Keyword:
CONVEX REFORMULATION
ASSIGNMENT PROBLEM
RELAXATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
引用论文
Stability of Reference Genes for Messenger RNA Quantification by Real-Time PCR in Mouse Dextran Sodium Sulfate Experimental Colitis.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏Flammability characteristics of thermally modified oak wood treated with a fire retardantBioResources
OAAI
BioResourcesIF0
OAAI分享收藏Correction: 2'-O-methylation of the mRNA cap protects RNAs from decapping and degradation by DXOPLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容