3 citations · 3 across the 3 of their papers we have counts for
4 papers · 1 filter
Minsum -Sink Problem on Path Networks
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa +2
We consider the problem of locating a set of sinks on a path network with general edge capacities that minimizes the sum of the evacuation times of all evacuees. We first prese…
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda +1
Evacuation in emergency situations can be modeled by a dynamic flow network. Two criteria have been used before: one is the evacuation completion time and the other is the aggregat…
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 -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…