1 citations · 1 across the 2 of their papers we have counts for
3 papers
On NP-completeness of the cell formation problem
Mikhail V. Batsyn, Ekaterina K. Batsyna, Ilya S. Bychkov
In the current paper we provide a proof of NP-completeness for the CFP problem with the fractional grouping efficacy objective. For this purpose we first consider the CFP with the…
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search
Alexander Ponomarenko, Irina Utkina, Mikhail Batsyn
One of the approaches for the nearest neighbor search problem is to build a network which nodes correspond to the given set of indexed objects. In this case the search of the close…
A branch and bound algorithm for a fractional 0-1 programming problem
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manuf…