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

Discover the innovative approach to multiobjective mixed-integer convex optimization in Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization by Stefan Rocktäschel. Published in 2020 by Springer Fachmedien Wiesbaden, this insightful paperback edition spans 70 pages and delves into the intricacies of a branch-and-bound algorithm designed to effectively determine a cover of the efficient set.

Rocktäschel meticulously examines the specific steps of this algorithm, providing readers with a comprehensive understanding of its application and functionality. By enhancing the basic algorithm with crucial modifications, he ensures a more accurate representation of the efficient set, making this book an essential resource for researchers and practitioners in the field of optimization.

Whether you are a student or a professional, this book is a valuable addition to your library, offering a blend of theoretical insights and practical applications in the realm of mixed-integer convex optimization.