I was wondering if there is a way to get the basis at a final node of a branch-and-bound procedure, so including the additional constraints from cuts and bounds.
My goal is to compute a cone pointing from the feasible vertex and towards the final polyhedron.