Cutting Plane Usage

Hello, not sure if this is the right place to ask this, but I'll try anyways.

I am interested in solving integer programs using _only_ cutting planes - I have no problems adding and modifying the cut generator, but I was curious to see if there was a way to strip out all pre- and post-processing, including the usage of branch and bound, and rely only on the iteration of generating cutting planes and adding them to the problem formulation.

Any help will be appreciated, thank you!

Additionally, you've built a wonderful and straightforward tool. Thank you for that as well!