Hello everyone,
I am a beginner in Julia and am currently exploring the Bonobo package for solving branch and bound algorithms. However, I’m finding it a bit challenging to get started. Could someone please provide me with a simple, detailed example of how to implement a basic branch and bound algorithm using the Bonobo package? A step-by-step explanation would be incredibly helpful for me to understand the process better.
Thank you in advance for your assistance!
Best regards,
Mohammadreza