81 citations · 142 across the 18 of their papers we have counts for
22 papers
Polyhedral Methods for Cooperative Games: Small Lifts and Hard Faces
Hans Raj Tiwary, Michel Grabisch
We study the computational complexity of fundamental algorithmic problems -- membership testing, separation, valid-inequality testing, and linear optimization -- over polytopes and…
Min-Max Connected Multiway Cut
Hans Raj Tiwary, Petr Kolman
We introduce a variant of the multiway cut that we call the min-max connected multiway cut. Given a graph and a set of terminals, partition into $t…
Bond Polytope under Vertex- and Edge-sums
Petr Kolman, Hans Raj Tiwary
A cut in a graph is called a {\em bond} if both parts of the cut induce connected subgraphs in , and the {\em bond polytope} is the convex hull of all bonds. Computing the m…
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…
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach
Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary
It can be shown that each permutation group can be embedded, in a well defined sense, in a connected graph with vertices. Some groups, however, requi…
On the extension complexity of scheduling
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
Linear programming is a powerful method in combinatorial optimization with many applications in theory and practice. For solving a linear program quickly it is desirable to have a…