1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
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…