Télécharger le livre :  A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Ajouter à ma liste d'envies
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...

Editeur : Springer Spektrum
Parution : 2020-01-21
Collection : BestMasters
PDF

52,74