A Branch-and-Bound Algorithm for Mu - E-book

eBook

A Branch-and-bound Algorithm For Multiobjective Mixed-integer Convex Optimization - ENG

Stefan Rocktäschel

eBook

$1,100.00

Disponible

Información adicional
Sinopsis

ISBN:	9783658291495
Formato:	Page Fidelity
Idioma:	Inglés
Editorial:	Springer Nature
Tema:	Matemáticas
Subtema:	Aplicada
Año de publicación:	2020-01-21

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.

eBooks