1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 1 cited
Using modular decomposition technique to solve the maximum clique problem
Irina Utkina
In this article we use the modular decomposition technique for exact solving the weighted maximum clique problem. Our algorithm takes the modular decomposition tree from the paper…
cs.DS2016
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…