.png){kind=icon}
Return
Solving 0-1 Quadratic Programs by Reformulation Techniques
.png){kind=icon}
PRE
AI
DOI：10.1021/acs.iecr.7b01270.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
CONVEX REFORMULATION
ASSIGNMENT PROBLEM
RELAXATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.9
Papers:
4.0W
Citations:
9.6W
Organization
Cited Papers
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
OAAIShareSaveFlammability characteristics of thermally modified oak wood treated with a fire retardantBioResources
OAAI
BioResourcesIF0
OAAIShareSaveShareSaveCorrection: 2'-O-methylation of the mRNA cap protects RNAs from decapping and degradation by DXOPLOS ONEOAAI
PLOS ONEIF0
OAAIShareSaveShareSaveShareSave
View more