Overview
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.The book, A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters) [Bulk, Wholesale, Quantity] ISBN#9783658291488 in Paperback by Stefan Rocktäschel may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details