Revisiting some classical linearizations of the quadratic binary optimization problem
<|reference_start|>Revisiting some classical linearizations of the quadratic binary optimization problem: In this paper, we present several new linearizations of a quadratic binary optimization problem (QBOP), primarily using the method of aggregations. Although aggregations were studied in the past in the context of solving system of Diophantine equations in non-negative variables, none of the approaches developed produced practical models, particularly due to the large size of associate multipliers. Exploiting the special structure of QBOP we show that selective aggregation of constraints provide valid linearizations with interesting properties. For our aggregations, multipliers can be any non-zero real numbers. Moreover, choosing the multipliers appropriately, we demonstrate that the resulting LP relaxations have value identical to the corresponding non-aggregated models. We also provide a review of existing explicit linearizations of QBOP and presents the first systematic study of such models. Theoretical and experimental comparisons of new and existing models are also provided.<|reference_end|>
@article{punnen2024revisiting,
    title={Revisiting some classical linearizations of the quadratic binary
  optimization problem},
    author={Abraham P. Punnen (1) and Navpreet Kaur (1) ((1) Department of
  Mathematics, Simon Fraser University Surrey, BC, Canada)},
    journal={arXiv preprint arXiv:2404.09437},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.09437},
    primaryClass={cs.DM math.OC}
}