On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope

10/13/2020
by   Pawan Aurora, et al.
0

The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter n - n - is defined as the convex hull of rank-1 matrices xx^T with x as the vectorized n× n permutation matrices. In this paper we consider all the known exponential-sized families of facet-defining inequalities of the QAP-polytope. We describe a new family of valid inequalities that we show to be facet-defining. We also show that membership testing (and hence optimizing) over some of the known classes of inequalities is coNP-complete. We complement our hardness results by showing a lower bound of 2^Ω(n) on the extension complexity of all relaxations of n for which any of the known classes of inequalities are valid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2021

Facets of the Total Matching Polytope for bipartite graphs

The Total Matching Polytope generalizes the Stable Set Polytope and the ...
research
01/26/2018

On bounded pitch inequalities for the min-knapsack polytope

In the min-knapsack problem one aims at choosing a set of objects with m...
research
04/26/2019

Polyhedral Properties of the Induced Cluster Subgraphs

A cluster graph is a graph whose every connected component is a complete...
research
05/20/2021

Total Coloring and Total Matching: Polyhedra and Facets

A total coloring of a graph G = (V, E) is an assignment of colors to ver...
research
03/03/2021

Facets of the cone of exact games

The class of exact transferable utility coalitional games, introduced in...
research
12/22/2020

The Circlet Inequalities: A New, Circulant-Based Facet-Defining Inequality for the TSP

Facet-defining inequalities of the symmetric Traveling Salesman Problem ...
research
04/06/2023

Some families of Jensen-like inequalities with application to information theory

It is well known that the traditional Jensen inequality is proved by low...

Please sign up or login with your details

Forgot password? Click here to reset