The Bipartite Boolean Quadric Polytope

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED Discrete Optimization Pub Date : 2022-05-01 DOI:10.1016/j.disopt.2021.100657

Piyashat Sripratak , Abraham P. Punnen , Tamon Stephen

{"title":"The Bipartite Boolean Quadric Polytope","authors":"Piyashat Sripratak , Abraham P. Punnen , Tamon Stephen","doi":"10.1016/j.disopt.2021.100657","DOIUrl":null,"url":null,"abstract":"<div>We consider the Bipartite Boolean Quadratic Programming Problem (BQP01), which generalizes the well-known Boolean quadratic programming problem (QP01). The model has applications in graph theory, matrix factorization and bioinformatics, among others. The primary focus of this paper is on studying the structure of the Bipartite Boolean Quadric Polytope (BQP<math><msup><mrow></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msup></math>) resulting from a linearization of a quadratic integer programming formulation of BQP01.We present some basic properties and partial relaxations of BQP<math><msup><mrow></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msup></math>, as well as some families of facets and valid inequalities. We find facet-defining inequalities including a family of odd-cycle inequalities. We discuss various approaches to obtain a valid inequality and facets from those of the related Boolean quadric polytope. The key strategy is based on rounding coefficients, and it is applied to the families of clique and cut inequalities in BQP<math><msup><mrow></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msup></math>.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"44 ","pages":"Article 100657"},"PeriodicalIF":0.9000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.disopt.2021.100657","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Optimization","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1572528621000360","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 5

Abstract

We consider the Bipartite Boolean Quadratic Programming Problem (BQP01), which generalizes the well-known Boolean quadratic programming problem (QP01). The model has applications in graph theory, matrix factorization and bioinformatics, among others. The primary focus of this paper is on studying the structure of the Bipartite Boolean Quadric Polytope (BQP $^{m, n}$ ) resulting from a linearization of a quadratic integer programming formulation of BQP01.

We present some basic properties and partial relaxations of BQP $^{m, n}$ , as well as some families of facets and valid inequalities. We find facet-defining inequalities including a family of odd-cycle inequalities. We discuss various approaches to obtain a valid inequality and facets from those of the related Boolean quadric polytope. The key strategy is based on rounding coefficients, and it is applied to the families of clique and cut inequalities in BQP $^{m, n}$ .

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

二部布尔二次多边形

我们考虑二部布尔二次规划问题(BQP01)，它推广了著名的布尔二次规划问题(QP01)。该模型在图论、矩阵分解和生物信息学等领域具有广泛的应用。本文主要研究了由BQP01的二次整数规划公式线性化而得到的二部布尔二次多边形(BQPm,n)的结构。给出了BQPm,n的一些基本性质和部分松弛，以及一些平面族和有效不等式。我们发现面定义不等式包括奇循环不等式族。讨论了从相关布尔二次多边形的不等式和面中获得有效不等式和面的各种方法。关键策略是基于舍入系数的，并将其应用于BQPm中的团不等式和切不等式族。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.

期刊最新文献

Anchor-robust project scheduling with non-availability periods Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723 Circuit and Graver walks and linear and integer programming Approximation schemes for Min-Sum k-Clustering Easy and hard separation of sparse and dense odd-set constraints in matching