3 citations · 3 across the 2 of their papers we have counts for
4 papers
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
Vladyslav Sokol, Ante Ćustić, Abraham P. Punnen +1
The bilinear assignment problem (BAP) is a generalization of the well-known quadratic assignment problem (QAP). In this paper, we study the problem from the computational analysis…
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…
The -Center Problem in Tree Networks Revisited
Aritra Banik, Binay Bhattacharya, Sandip Das +2
We present two improved algorithms for weighted discrete -center problem for tree networks with vertices. One of our proposed algorithms runs in $O(n \log n + p \log^2 n \lo…
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…