1 paper
Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira +1
In this work, we explore heuristics for the Adjacency Graph Packing problem, which can be applied to the Double Cut and Join (DCJ) Distance Problem. The DCJ is a rearrangement oper…