: Stefan Rocktäschel
: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
: Springer Spektrum
: 9783658291495
: 1
: CHF 47.10
:
: Sonstiges
: English
: 70
: Wasserzeichen
: PC/MAC/eReader/Tablet
: PDF
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.

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