Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem

02/03/2018
by   Abraham P. Punnen, et al.
0

The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented by two data points, a quadratic cost matrix Q and a linear cost vector c. Different, but equivalent, representations of the pair (Q, c) for the same QCOP are well known in literature. Research papers often state that without loss of generality we assume Q is symmetric, or upper-triangular or positive semidefinite, etc. These representations however have inherently different properties. Popular general purpose 0-1 QCOP solvers such as GUROBI and CPLEX do not suggest a preferred representation of Q and c. Our experimental analysis discloses that GUROBI prefers the upper triangular representation of the matrix Q while CPLEX prefers the symmetric representation in a statistically significant manner. Equivalent representations, although preserve optimality, they could alter the corresponding lower bound values obtained by various lower bounding schemes. For the natural lower bound of a QCOP, symmetric representation produced tighter bounds, in general. Effect of equivalent representations when CPLEX and GUROBI run in a heuristic mode are also explored. Further, we review various equivalent representations of a QCOP from the literature that have theoretical basis to be viewed as strong and provide new theoretical insights for generating such equivalent representations making use of constant value property and diagonalization (linearization) of QCOP instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2021

SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization

We study the rank of the Sum of Squares (SoS) hierarchy over the Boolean...
research
11/11/2020

Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers

We present Ecole, a new library to simplify machine learning research fo...
research
12/20/2021

Learning for Robust Combinatorial Optimization: Algorithm and Application

Learning to optimize (L2O) has recently emerged as a promising approach ...
research
08/23/2023

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements

The k-dimensional Weisfeiler-Leman (k-WL) algorithm is a simple combinat...
research
05/26/2019

Taxonomization of Combinatorial Optimization Problems in Fourier Space

We propose and develop a novel framework for analyzing permutation-based...
research
08/19/2018

Lower bound for the cost of connecting tree with given vertex degree sequence

The optimal connecting network problem generalizes many models of struct...

Please sign up or login with your details

Forgot password? Click here to reset