Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience