3 citations · 3 across the 1 of their papers we have counts for
3 papers
math.OC2016
The Bilinear Assignment Problem: Complexity and polynomially solvable special cases
Ante Ćustić, Vladyslav Sokol, Abraham P. Punnen +1
In this paper we study the {\it bilinear assignment problem} (BAP) with size parameters and , . BAP is a generalization of the well known quadratic assignment probl…
cs.DS2016
The Quadratic Minimum Spanning Tree Problem and its Variations
Ante Ćustić, Ruonan Zhang, Abraham P. Punnen
The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constrai…
cs.DM2015★ 3 cited
Approximation Algorithms for Generalized MST and TSP in Grid Clusters
Binay Bhattacharya, Ante Ćustić, Akbar Rafiey +2
We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside…