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

Stefan Rocktäschel

ISBN 10: 3658291486 / ISBN 13: 9783658291488

Edité par Springer Fachmedien Wiesbaden Jan 2020, 2020

A propos de cet article

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 80 pp. Englisch. N° de réf. du vendeur 9783658291488

Détails bibliographiques

Titre : A Branch-and-Bound Algorithm for ...

Éditeur : Springer Fachmedien Wiesbaden Jan 2020

Date d'édition : 2020

Reliure : Taschenbuch

Etat : Neu

A propos de ce titre

Synopsis :

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.

À propos de l?auteur:

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