A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Author:   Stefan Rocktäschel
Publisher:   Springer Fachmedien Wiesbaden
Edition:   2020 ed.
ISBN:  

9783658291488


Pages:   70
Publication Date:   22 January 2020
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $116.41 Quantity:  
Add to Cart

Share |

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


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.

Full Product Details

Author:   Stefan Rocktäschel
Publisher:   Springer Fachmedien Wiesbaden
Imprint:   Springer Spektrum
Edition:   2020 ed.
Weight:   0.454kg
ISBN:  

9783658291488


ISBN 10:   3658291486
Pages:   70
Publication Date:   22 January 2020
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Theoretical basics for solving multiobjective mixed-integer convex optimization problems.- An algorithm for solving this class of optimization problems.- Test instances and numerical results.

Reviews

Author Information

Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now