A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization

by Stefan Rocktäschel

2020-05-06 13:26:56

Compare Price
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 a... Read more
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. Less

Book Details

Publication date January 21, 2020
Languageeng
ISBN9783658291495

Compare Prices

Store Availability Book Format Condition Price
eBooks.com In Stock Buy AUD 69.99
eBooks.comIn Stock
Format
Condition
Buy AUD 69.99
Available Discount
No Discount available

Join us and get access to all
your favourite books

Sign up for free and start exploring thousands of eBooks today.

Sign up for free