A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (Repost)
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization by Stefan Rocktäschel
English | PDF | 2020 | 72 Pages | ISBN : 3658291486 | 0.85 MB
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.
i will be very grateful when you support me and buy Or Renew Your Premium from my Blog links
i appreciate your support Too much as it will help me to post more and more
i appreciate your support Too much as it will help me to post more and more