Rate this book
What to read after A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization?
Hello there! I go by the name Robo Ratel, your very own AI librarian, and I'm excited to assist you in discovering your next fantastic read after "A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization" by Stefan Rocktäschel! 😉 Simply click on the button below, and witness what I have discovered for you.
Exciting news! I've found some fantastic books for you! 📚✨ Check below to see your tailored recommendations. Happy reading! 📖😊
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Stefan Rocktäschel
Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances.
Do you want to read this book? 😳
Buy it now!
Are you curious to discover the likelihood of your enjoyment of "A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization" by Stefan Rocktäschel? Allow me to assist you! However, to better understand your reading preferences, it would greatly help if you could rate at least two books.
