Branch-and-bound algorithm for multiobjective mixed-integer convex optimization, a
Auteur :
Rocktäschel, Stefan
Éditeur :
Springer Fachmedien Wiesbaden
ISBN :
9783658291488
Date de publication :
22 janv. 2020
Dimensions :
21,0 x 14,8 cm
Langue :
Anglais
Pays d'origine :
Allemagne
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.