3 citations · 3 across the 3 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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 -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…