1 citations · 1 across the 5 of their papers we have counts for
5 papers
On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope
Pawan Aurora, Hans Raj Tiwary
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 par…
Spectral properties of the Cayley Graphs of split metacyclic groups
Kashyap Rajeevsarathy, Siddhartha Sarkar, S. Lakshmivarahan +1
Let denote the Cayley graph of a group with respect to a set . In this paper, we analyze the spectral properties of the Cayley graphs $\mathcal{T}_{m,n,k}…
New Facets of the QAP-Polytope
Pawan Kumar Aurora, Shashank K Mehta
The Birkhoff polytope is defined to be the convex hull of permutation matrices, . We define a second-order permutation matrix in $\mathbb{R}^{n^2…
Completely Positive formulation of the Graph Isomorphism Problem
Shashank K Mehta, Pawan Aurora
Given two graphs and on vertices each, we define a graph on vertex set and the edge set as the union of edges of , $\bar{G_…
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds
Pawan Aurora, Sumit Singh, Shashank K. Mehta
We study the Partial Degree Bounded Edge Packing (PDBEP) problem introduced in [5] by Zhang. They have shown that this problem is NP-Hard even for uniform degree constraint. They a…