[Scip] algorithm MINLP solver?

[Liffey1986@gmx.de]

Dear SCIP-users,

I am using SCIP as a solver for nonconvex MINLPs, but I don't exactly understand how the algorithm works.

As far as I know SCIP uses a spatial branch-and-bound-algorithm for nonconvex MINLPs. But now I read it's also a branch-and-cut solver. Does that mean, it's a spatial branch-and-cut-algorithm? Or am I mixing it up now?
I'm a bit confused. The more I read, the less I understand...

Many Thanks
Ina