The boolean quadric polytope: Some characteristics, facets and relatives

We study unconstrained quadratic zero–one programming problems havingn variables from a polyhedral point of view by considering the Boolean quadric polytope QPn inn(n+1)/2 dimensions that results from the linearization of the quadratic form. We show that QPn has a diameter of one, descriptively identify three families of facets of QPn and show that QPn is symmetric in the sense that all facets of QPn can be obtained from those that contain the origin by way of a mapping. The naive linear programming relaxation QPnLP of QPn is shown to possess the Trubin-property and its extreme points are shown to be {0,1/2,1}-valued. Furthermore, O(n3) facet-defining inequalities of QPn suffice to cut off all fractional vertices of QPnLP, whereas the family of facets described by us has at least O(3n) members. The problem is also studied for sparse quadratic forms (i.e. when several or many coefficients are zero) and conditions are given for the previous results to carry over to this case. Polynomially solvable problem instances are discussed and it is shown that the known polynomiality result for the maximization of nonnegative quadratic forms can be obtained by simply rounding the solution to the linear programming relaxation. In the case that the graph induced by the nonzero coefficients of the quadratic form is series-parallel, a complete linear description of the associated Boolean quadric polytope is given. The relationship of the Boolean quadric polytope associated to sparse quadratic forms with the vertex-packing polytope is discussed as well.

[1]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[2]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[3]  I. Rosenberg,et al.  Application of pseudo-Boolean programming to the theory of graphs , 1964 .

[4]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[5]  P. Camion.  Characterization of totally unimodular matrices , 1965 .

[6]  M. Balinski.  Notes—On a Selection Problem , 1970 .

[7]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[8]  M. Desu.  A Selection Problem , 1970 .

[9]  M. Padberg.  Essays in integer programming , 1971 .

[10]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[11]  J. Trotter.  Solution characteristics and algorithms for the vertex packing problem. , 1973 .

[12]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[13]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[14]  M. R. Rao,et al.  The travelling salesman problem and a class of polyhedra of diameter two , 1974, Math. Program..

[15]  Jon W. Tolle,et al.  A unified approach to complementarity in optimization , 1974, Discret. Math..

[16]  Leslie E. Trotter,et al.  A class of facet producing graphs for vertex packing polyhedra , 1975, Discret. Math..

[17]  Manfred W. Padberg.  Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..

[18]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[19]  H. D. Ratliff,et al.  Minimum cuts and related problems , 1975, Networks.

[20]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[21]  L. A. Wolsey,et al.  Further facet generating procedures for vertex packing polytopes , 1976, Math. Program..

[22]  M. Padberg.  Almost integral polyhedra related to certain combinatorial optimization problems , 1976 .

[23]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[24]  M. Padberg.  On the Complexity of Set Packing Polyhedra , 1977 .

[25]  Eitan Zemel,et al.  Lifting the facets of zero–one polytopes , 1978, Math. Program..

[26]  P. Hansen.  Methods of Nonlinear 0-1 Programming , 1979 .

[27]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[28]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[29]  Mouloud Boulala,et al.  Polytope des independants d'un graphe serie-parallele , 1979, Discret. Math..

[30]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[31]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[32]  Eberhard Girlich,et al.  Nichtlineare diskrete Optimierung , 1981 .

[33]  Egon Balas,et al.  The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.

[34]  Egon Balas,et al.  Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..

[35]  Pierre Hansen,et al.  Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..

[36]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[37]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[38]  Egon Balas,et al.  Nonlinear 0–1 programming: I. Linearization techniques , 1984, Math. Program..

[39]  V. A. Yemelicher,et al.  Polytopes, Graphs and Optimisation , 1984 .

[40]  Martin Grötschel,et al.  Facets of the Bipartite Subgraph Polytope , 1985, Math. Oper. Res..

[41]  Francisco Barahona,et al.  A solvable case of quadratic 0-1 programming , 1986, Discret. Appl. Math..

[42]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[43]  M. Padberg.  Total unimodularity and the Euler-subgraph problem , 1988 .

[44]  A. R. Mahjoub,et al.  On the stable set polytope of a series-parallel graph , 1988, Math. Program..

[45]  Michael Jünger,et al.  Experiments in quadratic 0–1 programming , 1989, Math. Program..

[46]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[47]  Martin Grötschel,et al.  Facets of the clique partitioning polytope , 1990, Math. Program..