A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
- Editore:
Springer Fachmedien Wiesbaden
- Collana:
- BestMasters
- EAN:
9783658291488
- ISBN:
3658291486
- Pagine:
- 80
- Formato:
- Paperback
- Lingua:
- Tedesco
Acquistabile con
o la
Descrizione A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
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.
Fuori catalogo - Non ordinabile
Recensioni degli utenti
e condividi la tua opinione con gli altri utenti