{"product_id":"9783658291488","title":"BestMasters","description":"\u003ch1\u003eBestMasters\u003c\/h1\u003e \u003ch2\u003eRocktäschel, Stefan\u003c\/h2\u003e \u003cp\u003eStefan 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer Spektrum\u003c\/p\u003e \u003cp\u003ePublication Date: 2020-01-22\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9783658291488\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-3-658-29149-5\u003c\/p\u003e \u003cp\u003eDimensions: 210cm x148cm\u003c\/p\u003e \u003cp\u003ePages: 70\u003c\/p\u003e ","brand":"Springer Fachmedien Wiesbaden","offers":[{"title":"Default Title","offer_id":44807345045644,"sku":"9783658291488","price":49.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783658291488.jpg?v=1775835114","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9783658291488","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}