Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms

Autor: Sokol, Vladyslav, Ćustić, Ante, Punnen, Abraham P., Bhattacharya, Binay

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 point of view. Several classes of neigborhood structures are introduce

Externí odkaz: http://arxiv.org/abs/1707.07057

Approximation Algorithms for Generalized MST and TSP in Grid Clusters

Autor: Bhattacharya, Binay, Ćustić, Ante, Rafiey, Akbar, Rafiey, Arash, Sokol, Vladyslav

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 the integer grid (in Euclidean plane) where each grid cell is $1 \time

Externí odkaz: http://arxiv.org/abs/1507.04438

The bilinear assignment problem: complexity and polynomially solvable special cases.

Autor: Ćustić, Ante¹ acustic@sfu.ca, Sokol, Vladyslav² vsokol@sfu.ca, Punnen, Abraham¹ apunnen@sfu.ca, Bhattacharya, Binay² binay@sfu.ca

Publikováno v: Mathematical Programming. Nov2017, Vol. 166 Issue 1/2, p185-205. 21p.

On some nonlinear assignment problems

Autor: Sokol, Vladyslav

Linear assignment problem (commonly referred to as just assignment problem) is a fundamental problem in combinatorial optimization. The goal is to assign n workers to do n jobs so that the linear sum of corresponding costs is minimized. The linear as

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______497::9e3a13b550b29dcea98abb11a4abca99
http://summit.sfu.ca/item/17954

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle.

Autor: Bhattacharya, Binay, De, Minati, Kameda, Tsunehiko, Roy, Sasanka, Sokol, Vladyslav, Song, Zhao

Publikováno v: Computing & Combinatorics: 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings; 2014, p417-428, 12p