Convex Hulls for Graphs of Quadratic Functions With Unit Coefficients: Even Wheels and Complete Split Graphs

07/11/2020
by   Mitchell Harris, et al.
0

We study the convex hull of the graph of a quadratic function f(𝐱)=∑_ij∈ Ex_ix_j, where the sum is over the edge set of a graph G with vertex set {1,…,n}. Using an approach proposed by Gupte et al. (Discrete Optimization 36, 2020, 100569), we investigate minimal extended formulations using additional variables y_ij, 1≤ i<j≤ n, representing the products x_ix_j. The basic idea is to identify a set of facets of the Boolean Quadric Polytope which is sufficient for characterizing the convex hull for the given graph. Our main results are extended formulations for the cases that the underlying graph G is either an even wheel or a complete split graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2020

Convex Hulls and Simple Colourings in Directed and 2-edge-Coloured Graphs

An oriented graph (2-edge-coloured graph) is complete convex when the co...
research
07/26/2023

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs

Cover-Incomparability graphs (C-I graphs) are an interesting class of gr...
research
01/29/2021

Between steps: Intermediate relaxations between big-M and convex hull formulations

This work develops a class of relaxations in between the big-M and conve...
research
09/15/2023

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization

With the goal of obtaining strong relaxations for binary polynomial opti...
research
02/10/2022

P-split formulations: A class of intermediate formulations between big-M and convex hull for disjunctive constraints

We develop a class of mixed-integer formulations for disjunctive constra...
research
04/18/2018

On bounds on bend number of classes of split and cocomparability graphs

A k-bend path is a rectilinear curve made up of k + 1 line segments. A B...
research
05/05/2021

Isomorphic Boolean networks and dense interaction graphs

A Boolean network (BN) with n components is a discrete dynamical system ...

Please sign up or login with your details

Forgot password? Click here to reset