A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Rocktäschel, Stefan
41,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
21 °P sammeln
  • Broschiertes Buch

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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.
Autorenporträt
Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.